Real-time Concurrent Collection on Stock Multiprocessors

Real-time Concurrent Collection on Stock Multiprocessors (1988)

Cached

Download Links

[www.cs.princeton.edu]

Other Repositories/Bibliography

DBLP

by Andrew W. Appel , John R. Ellis , Kai Li

Venue:	ACM SIGPLAN Notices
Citations:	85 - 7 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Real-time Concurrent Collection on Stock Multiprocessors	user correction - Legacy Corrections
AUTHOR NAME	Andrew W. Appel	user correction - Legacy Corrections
AUTHOR NAME	John R. Ellis	user correction - Legacy Corrections
AUTHOR AFFIL	2	user correction - Legacy Corrections
AUTHOR NAME	Kai Li	user correction - Legacy Corrections
AUTHOR AFFIL	1	user correction - Legacy Corrections
ABSTRACT	We have designed and implemented a copying garbage-collection algorithm that is efficient, real-time, concurrent, runs on commerial 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 have 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. Introduction This paper presents the first copying garbage-collection algorithm that is efficient, real-time, concurrent, runs on stock commercial uniprocessors and multiprocessors, and requires no change to compilers. A collection algorithm is efficient if the amortized cost to allocate, access, and collect an object is small compared to the cost of initializing the o...	user correction - Legacy Corrections
YEAR	1988	INFERENCE
VENUE	ACM SIGPLAN Notices	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	11--20	INFERENCE
VOLUME	23	INFERENCE
TECH	Technical Report 25	INFERENCE
CITATIONS	17 found	ParsCit 1.0