The Need for Predictable Garbage Collection

The Need for Predictable Garbage Collection (1999)

Cached

Download Links

[www.cs.utah.edu]
[www.cs.utah.edu]

Other Repositories/Bibliography

CiteULike

by Alastair Reid , John Mccorquodale , Jason Baker , Wilson Hsieh , Joseph Zachary

Venue:	In Proceedings of the ACM SIGPLAN Workshop on Compiler Support for System Software (WCSSS’99
Citations:	6 - 0 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Need for Predictable Garbage Collection	user correction - Legacy Corrections
AUTHOR NAME	Alastair Reid	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Utah	user correction - Legacy Corrections
AUTHOR NAME	John Mccorquodale	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Utah	user correction - Legacy Corrections
AUTHOR NAME	Jason Baker	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Utah	user correction - Legacy Corrections
AUTHOR NAME	Wilson Hsieh	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Utah	user correction - Legacy Corrections
AUTHOR NAME	Joseph Zachary	user correction - Legacy Corrections
AUTHOR AFFIL	Department of Computer Science; University of Utah	user correction - Legacy Corrections
ABSTRACT	Modern programming languages such as Java are increasingly being used to write systems programs. By "systems programs," we mean programs that provide critical services (compilers), are long-running (Web servers), or have time-critical aspects (databases or query engines). One of the requirements of such programs is predictable behavior. Unfortunately, predictability is often compromised by the presence of garbage collection. Various researchers have examined the feasibility of replacing garbage collection with forms of stack allocation that are more predictable than GC, but the applicability of such research to systems programs has not been studied or measured. A particularly promising approach allocates objects in the nth stack frame (instead of just the topmost frame): we call this deep stack allocation. We present dynamic profiling results for several Java programs to show that deep stack allocation should benefit systems programs, and we describe the approach that we are developin...	user correction - Legacy Corrections
YEAR	1999	INFERENCE
VENUE	In Proceedings of the ACM SIGPLAN Workshop on Compiler Support for System Software (WCSSS’99	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	99	INFERENCE
CITATIONS	17 found	ParsCit 1.0