Real-time concurrent collection on stock multiprocessors
Authors:
Open Access
- 1 June 1988
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 23 (7) , 11-20
Abstract
We've designed and implemented a copying garbage-collection algorithm that is efficient, real-time, concurrent, runs on commercial uniprocessors and shared-memory multiprocessors, and requires no change to compilers. The algorithm uses standard virtual-memory hardware to detect references to “from space” objects and to synchronize the collector and mutator threads. We've implemented and measured a prototype running on SRC's 5-processor Firefly. It will be straightforward to merge our techniques with generational collection. An incremental, non-concurrent version could be implemented easily on many versions of Unix.Keywords
This publication has 9 references indexed in Scilit:
- Firefly: a multiprocessor workstation1987
- Garbage collection can be faster than stack allocationInformation Processing Letters, 1987
- Performance analysis of on-the-fly garbage collectionCommunications of the ACM, 1984
- Garbage collection in a large LISP system1984
- Compiling a functional language1984
- Implementation of multilisp1984
- Trading data space for reduced time and code space in real-time garbage collection on stock hardware1984
- A real-time garbage collector based on the lifetimes of objectsCommunications of the ACM, 1983
- List processing in real time on a serial computerCommunications of the ACM, 1978