Mark-Sweep
by Leandro Lucarella on 2008- 09- 16 02:25 (updated on 2008- 09- 16 02:25)- with 0 comment(s)
After a busy week (unfortunately not working on my thesis), I'll move on to mark-sweep algorithms (I've covered the basic reference counting stuff for now).
The GC book start with some obvious optimizations about making the marking phase non recursive using an explicit stack and methods to handle stack overflow.
Since current D's GC is mark-sweep, I think I have to take a (deeper) look at it now, to see what optimizations is actually using (I don't think D GC is using the primitive recursive algorithm) and take that as the base ground to look for improvements.