[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Is anyone working on a better garbage collector for T? Something along the
lines of a symbolics like ephemeral grabage collector would be nice. I'm
running a T program for which it is common to have 6 megabytes of relatively
static data. Having to always copy the entire heap makes GC very painful.
Also, having a static heap size and two full size heaps are also very
inconvenient. Has anyone though about implementing a GC algorithm that has
a segmented heap and only copies one segment at a time?