On Wednesday, 1 February 2012 at 22:53:11 UTC, Richard Webb wrote:
For reference, the file i was testing with has ~50000 root nodes, each of which has several children. The number of nodes seems to have a much larger effect on the speed that the amount of data.
Sounds about right. For very small allocations sweeping time dominates the total GC time. You can see the breakdown at https://github.com/dsimcha/druntime/wiki/GC-Optimizations-Round-2 . The Tree1 benchmark is the very small allocation benchmark. Sweeping takes time linear in the number of memory blocks allocated and, for blocks <1 page, constant time in the size of the blocks.
