Published in

ACM SIGPLAN Notices, 4(39), p. 205

DOI: 10.1145/989393.989417

ACM SIGPLAN Notices, 7(23), p. 11-20

DOI: 10.1145/960116.53992

Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation - PLDI '88

DOI: 10.1145/53990.53992

Links

Tools

Export citation

Search in Google Scholar

Real-Time Concurrent Collection on Stock Multiprocessors.

Journal article published in 1988 by John R. Ellis, Andrew W. Appel, Kai Li
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Green circle
Postprint: archiving allowed
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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 algorithms 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.