Sapphire: Copying GC Without Stopping the World (2001) [12 citations — 0 self]
http://aspen.ucs.indiana.edu/CandCPandE/jg2001/C56
http://www.cs.umass.edu/~moss/papers/jgrande-2001-
DBLP
CACHED:
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
author = {Richard L. Hudson and J. Eliot B. Moss},
title = {Sapphire: Copying GC Without Stopping the World},
booktitle = {IN JOINT ACM JAVA GRANDE — ISCOPE 2001 CONFERENCE},
year = {2001},
pages = {48--57},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmarks
OpenURL
Abstract:
Many concurrent garbage collection (GC) algorithms have been devised, but few have been implemented and evaluated, particularly for the Java programming language. Sapphire is an algorithm we have devised for concurrent copying GC. Sapphire stresses minimizing the amount of time any given application thread may need to block to support the collector. In particular, Sapphire is intended to work well in the presence of a large number of application threads, on small- to medium-scale shared memory multiprocessors. A specific problem that Sapphire addresses is not stopping all threads while thread stacks are adjusted to account for copied objects (in GC parlance, the "flip" to the new copies). Sapphire extends
