A simple real-time garbage collection algorithm is presented which does not copy, thereby avoiding some of the problems caused by the asynchronous motion of objects. This in-place "treadmill" garbage collection scheme has approximately the same complexity as other non-moving garbage collectors, thus making it usable in a high-level language implementation where some pointers cannot be traced. The treadmill is currently being used in a Lisp system built in Ada.
No takes yet. Share an insight, caveat, or question.
Henry G. Baker (1992) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: