This bibliography may be freely used for non-commercial purposes.
It may also be freely distributed provided that this notice is included.
I would be most grateful to receive additions, corrections and URLs of
electronically available papers.
The full bibliography
is also available in compressed
BibTeX (140k)
and
PDF
forms.
Further GC-related material can be found on
the Garbage Collection page.
Richard Jones
Copyright ©1996-2010 Richard Jones
Last updated 29 July 2010.
[A]
[B]
[C]
[D]
[E]
[F]
[G]
[H]
[I]
[J]
[K]
[L]
[M]
[N]
[O]
[P]
[Q]
[R]
[S]
[T]
[U]
[V]
[W]
[X]
[Y]
[Z]

[zabe07] Martin Zabel, Thomas B. Preuber, Peter Reichel, and Rainer G. Spallek.
Secure, real-time and multi-threaded general-purpose embedded Java
microarchitecture.
In DSD '07: Proceedings of the 10th Euromicro Conference on Digital System
Design Architectures, Methods and Tools, pages 59-62. IEEE Computer
Society, 2007.
Available here.
[zave75] Derek A. Zave.
A fast compacting garbage collector.
Information Processing Letters, 3(6):167-169, July 1975.
[zee02] Karen Zee and Martin Rinard.
Write barrier removal by static analysis.
ACM SIGPLAN Notices, 37(4), April 2002.
[zee02a] Karen Zee and Martin Rinard.
Write barrier removal by static analysis.
In OOPSLA 2002 [OOPSLA02], 2002, pages 191-210.
[zend06] Olivier Zendra.
Memory and compiler optimizations for low-power and energy.
In Implementation, Compilation, Optimization of Object-Oriented Languages,
Programs and Systems (ICOOOLPS'2006), page 8, Nantes, France, July
2006.
Available here.
[zhan98] Sean Zhang, Barbara G. Ryder, and William A. Landi.
Experiments with combined analysis for pointer aliasing.
In PASTE98 [PASTE98], 1998.
[zhan06] Chengliang Zhang, Kirk Kelsey, Xipeng Shen, Chen Ding, Matthew Hertz, and
Mitsunori Ogihara.
Program-level adaptive memory management.
In Petrank and Moss [ISMM06], 2006, pages 174-183.
[zhan08] Chengliang Zhang and Martin Hirzel.
Online phase-adaptive data layout selection.
In ECOOP 2008 [ECOOP08], 2008, pages 309-334.
Available here.
[zhao87] W. Zhao, K. Ramamritham, and J. A. Stankovic.
Scheduling tasks with resource requirements in hard real-time systems.
ACM Transactions on Software Engineering, 5(13):564-577, May 1987.
[zhao09] Yi Zhao, Jin Shi, Kai Zheng, Haichuan Wang, Haibo Lin, and Ling Shao.
Allocation wall: A limiting factor of Java applications on emerging
multi-core platforms.
In OOPSLA 2009 [OOPSLA09], 2009, pages 361-376.
Available here.
[zhon08] Yutao Zhong and Wentao Chang.
Sampling-based program locality approximation.
In Jones and Blackburn [ISMM08], 2008, pages 91-100.
Available here.
[zhou92] Songnian Zhou, Michael Stumm, Kai Li, and David Wortman.
Heterogeneous distributed shared memory.
IEEE Transactions on Parallel and Distributed Systems, 3(5):540-554,
September 1992.
[zhou00] Neng-Fa Zhou.
Garbage collection in B-Prolog.
In First Workshop on Memory Management in Logic Programming
Implementations, July 2000.
Available here.
[zigm00] John Zigman, Stephen M. Blackburn, and J. Eliot B. Moss.
TMOS: a transactional garbage collector.
In Kirby et al. [POS00], 2001, pages 116-135.
[zigm04] John Zigman.
A General Framework for the Description and Construction of Hierarchical
Garbage Collection Algorithms.
PhD thesis, Australian National University, 2004.
[zill07] Craig Zilles.
Accordion arrays: Selective compression of Unicode arrays in Java.
In Morrisett and Sagiv [ISMM07], 2007, pages 55-66.
[zorn87] Benjamin Zorn, Paul Hilfinger, Kinson Ho, and James R. Larus.
SPUR Lisp: Design and implementation.
Technical Report UCB/CSD 87/373, University of California, Berkeley, October
1987.
[zorn88] Benjamin Zorn, Paul Hilfinger, Kinson Ho, and James R. Larus.
A memory allocation profiler for C and Lisp programs.
In Proceedings for the Summer 1988 USENIX Conference, pages 223-237,
June 1988.
Available here.
[zorn92b] Benjamin Zorn and Dirk Grunwald.
Empirical measurements of six allocation-intensive C programs.
Computer Science Technical Report CU-CS-604-92, University of Colorado, July
1992.
Available here.
[zorn92c] Benjamin Zorn and Dirk Grunwald.
Empirical measurements of six allocation-intensive C programs.
ACM SIGPLAN Notices, 27(12):71-80, 1992.
[zorn92a] Benjamin Zorn and Dirk Grunwald.
Evaluating models of memory allocation.
Computer Science Technical Report CU-CS-603-92, University of Colorado, July
1992.
Available here.
[zorn94] Benjamin Zorn and Dirk Grunwald.
Evaluating models of memory allocation.
ACM Transactions on Modelling and Computer Simulation, 4(1), 1994.
[zorn98] Benjamin Zorn and M. Seidl.
Segregating heap objects by reference behavior and lifetime.
In ASPLOS 1998 [ASPLOS98], 1998, pages 12-23.
Available here.
[zorn89] Benjamin G. Zorn.
Comparative Performance Evaluation of Garbage Collection Algorithms.
PhD thesis, University of California at Berkeley, March 1989.
Technical Report UCB/CSD 89/544.
Available here.
[zorn90a] B. Zorn.
Designing systems for evaluation: A case study of garbage collection.
In Jul and Juul [OOPSLA90-gc], 1990.
Available here.
[zorn90b] Benjamin Zorn.
Barrier methods for garbage collection.
Technical Report CU-CS-494-90, University of Colorado, Boulder, November 1990.
Available here.
[zorn90] Benjamin Zorn.
Comparing mark-and-sweep and stop-and-copy garbage collection.
In LFP 1990 [LFP90], 1990.
[zorn91] Benjamin Zorn.
The effect of garbage collection on cache performance.
Technical Report CU-CS-528-91, University of Colorado at Boulder, May 1991.
Available here.
[zorn92] Benjamin Zorn.
The measured cost of garbage collection.
Technical Report CU-CS-573-92, University of Colorado at Boulder, Department
of Computer Science, Boulder, Colorado, April 1992.
Available here.
[zorn93] Benjamin Zorn.
The measured cost of conservative garbage collection.
Software Practice and Experience, 23:733-756, 1993.
[A]
[B]
[C]
[D]
[E]
[F]
[G]
[H]
[I]
[J]
[K]
[L]
[M]
[N]
[O]
[P]
[Q]
[R]
[S]
[T]
[U]
[V]
[W]
[X]
[Y]
[Z]
This file was generated by bib2htmlwritten by
Richard Jones
University of Kent at Canterbury