Real-time concurrent collection on stock multiprocessors

Andrew Wilson Appel, John R. Ellis, Kai Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

128 Scopus citations

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, nonconcurrent version could be implemented easily on many versions of Unix.

Original languageEnglish (US)
Title of host publicationProceedings of the ACM SIGPLAN 1988 Conference on Programming Language Design and Implementation, PLDI 1988
EditorsR.L. Wexelblat
PublisherAssociation for Computing Machinery
Pages11-20
Number of pages10
ISBN (Electronic)0897912691
DOIs
StatePublished - Jun 1 1988
EventACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 1988 - Atlanta, United States
Duration: Jun 20 1988Jun 24 1988

Publication series

NameProceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)
Volume20-24-June-1988

Other

OtherACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 1988
Country/TerritoryUnited States
CityAtlanta
Period6/20/886/24/88

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Real-time concurrent collection on stock multiprocessors'. Together they form a unique fingerprint.

Cite this