Portable, mostly-concurrent, mostly-copying garbage collection for multi-processors

Antony L. Hosking*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Citations (Scopus)

Abstract

Modern commodity platforms increasingly support thread-level parallelism, which must be exploited by garbage collected applications. We describe the design and implementation of a portable mostly-concurrent mostly-copying garbage collector that exhibits scalable performance on multi-processors. We characterize its performance for heap-intensive workloads on two different multi-processor platforms, showing maximum pause times two orders of magnitude shorter than for fully stop-the-world collection at the cost of some total mutator throughput.

Original languageEnglish
Title of host publicationISMM 2006 - Proceedings of the 2006 InternationalSymposium on Memory Management
Pages40-51
Number of pages12
DOIs
Publication statusPublished - 2006
Externally publishedYes
EventISMM 2006 - 2006 International Symposium on Memory Management - Ottawa, ON, Canada
Duration: 10 Jun 200611 Jun 2006

Publication series

NameInternational Symposium on Memory Management, ISMM
Volume2006

Conference

ConferenceISMM 2006 - 2006 International Symposium on Memory Management
Country/TerritoryCanada
CityOttawa, ON
Period10/06/0611/06/06

Fingerprint

Dive into the research topics of 'Portable, mostly-concurrent, mostly-copying garbage collection for multi-processors'. Together they form a unique fingerprint.

Cite this