George Russell wrote:
> (Is there anything better than Baker's train algorithm?)
Sorry, I meant "treadmill" not "train".  The train algorithm is an almost-bounded 
garbage collection algorithm.  (However it fails to be
properly bounded if you have large numbers of in-pointers to a node.)

Reply via email to