[MLton] Paging friendly GC?
Wesley W. Terpstra
wesley@terpstra.ca
Mon, 6 Feb 2006 16:48:23 +0100
Obviously, I'm no garbage collector expert.
However, I seem to recall that MLton uses a 'generational mark-sweep'
algorithm...?
I know that MLton performs very poorly once the heap size exceeds
physical
memory. The system thrashes to death. So, when I saw this, I thought
maybe
those of you with a clue might care:
http://www.cs.umass.edu/~emery/pubs/f034-hertz.pdf
Is this relevant / useful for MLton?
Could something like this make a self-compile feasible with < 512MB RAM?