Reducing the latency of a real-time garbage collector
- 1 March 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Letters on Programming Languages and Systems
- Vol. 1 (1) , 46-58
- https://doi.org/10.1145/130616.130621
Abstract
This paper shows how to make the latency of scanning a page in the Appel-Ellis-Li real-time garbage collector be proportional only to the number of object references on a page (the page size), instead of to the sum of the sizes of the objects referenced by the page. This makes the garbage collection algorithm much more suitable for real-time systems.Keywords
This publication has 13 references indexed in Scilit:
- Virtual memory primitives for user programsPublished by Association for Computing Machinery (ACM) ,1991
- A runtime systemHigher-Order and Symbolic Computation, 1990
- Garbage collection of strings and linked data structures in real timeSoftware: Practice and Experience, 1988
- Real-time concurrent collection on stock multiprocessorsPublished by Association for Computing Machinery (ACM) ,1988
- Tenuring policies for generation-based storage reclamationACM SIGPLAN Notices, 1988
- A third generation Smalltalk-80 implementationPublished by Association for Computing Machinery (ACM) ,1986
- 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
- An efficient, incremental, automatic garbage collectorCommunications of the ACM, 1976
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970