On bounding time and space for multiprocessor garbage collection
- 1 May 1999
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 34 (5) , 104-117
- https://doi.org/10.1145/301618.301648
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Real-time replication garbage collectionACM SIGPLAN Notices, 1993
- Lock-free garbage collection for multiprocessorsIEEE Transactions on Parallel and Distributed Systems, 1992
- Real-time garbage collection on general-purpose machinesJournal of Systems and Software, 1990
- Improving locality of reference in a garbage-collecting memory management systemCommunications of the ACM, 1988
- Real-time concurrent collection on stock multiprocessorsACM SIGPLAN Notices, 1988
- MULTILISP: a language for concurrent symbolic computationACM Transactions on Programming Languages and Systems, 1985
- Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential ProcessorsACM Transactions on Programming Languages and Systems, 1983
- List processing in real time on a serial computerCommunications of the ACM, 1978
- Multiprocessing compactifying garbage collectionCommunications of the ACM, 1975
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970