On Saturday, 15 November 2014 at 12:52:33 UTC, Ola Fosheim
Grøstad wrote:
Thanks for the link! I agree ML has some interesting work done
for it, but they make some assumptions:
1. low portion of mutable objects
2. small heap fits in per-core-cache (<256KiB on Haswell).
So the small heap is basically a region allocator that caches
allocations that are likely to die, cutting down on the more
costly effort to update the big heap. But I am not sure if that
fits system level programming, that is more typical for
functional programming…
The small heap do not apply for us. We can't reproduce that part
of the GC in D. However, the big heap part of the strategy would
fit D's immutable heap very nicely.
