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.)
- GC in embedded systems (was Re: Haskell and the N... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Byron Hale
- Re: GC in embedded systems (was Re: Hask... Manuel M. T. Chakravarty
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Manuel M. T. Chakravarty
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... Sengan
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Haskell ... George Russell
- Re: GC in embedded systems (was Re: Hask... George Russell
- Re: GC in embedded systems (was Re: Hask... Adrian Hey
- Re: GC in embedded systems (was Re: Hask... George Russell