The treadmill
Author:
- Henry G. BakerHBHenry G. Baker
Open Access
- 1 March 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 27 (3) , 66-70
Abstract
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.Keywords
This publication has 18 references indexed in Scilit:
- CONS should not CONS its arguments, or, a lazy alloc is a smart allocACM SIGPLAN Notices, 1992
- Structured programming with limited private types in AdaACM SIGAda Ada Letters, 1991
- Unify and conquer1990
- Efficient implementation of the first-fit strategy for dynamic storage allocationACM Transactions on Programming Languages and Systems, 1989
- Garbage collection in an uncooperative environmentSoftware: Practice and Experience, 1988
- Real-time concurrent collection on stock multiprocessors1988
- Safety consideration for storage allocation optimizations1988
- Algorithms for resolving conflicts in dynamic storage allocationJournal of the ACM, 1985
- Performance analysis of on-the-fly garbage collectionCommunications of the ACM, 1984
- List processing in real time on a serial computerCommunications of the ACM, 1978