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, Richard Jones
Last updated 19 March 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]

[yama98] Hirotaka Yamamoto, Kenjiro Taura, and Akinori Yonezawa.
Comparing reference counting and global mark-and-sweep on parallel
computers.
In Proceedings of Languages, Compilers, and Run-time Systems (LCR98),
Lecture Notes in Computer Science, May 1998.
Available here.
[yama98a] Hirotaka Yamamoto, Kenjiro Taura, and Akinori Yonezawa.
Performance comparison between reference counting and global GC on
distributed-memory parallel computers.
In Proceedings of Joint Symposium on Parallel Processing (JSPP), June
1998.
In Japanese.
Available here.
[yang02] Qian Yang, Witawas Srisa-an, Therapon Skotiniotis, and J. Morris Chang.
Java virtual machine probes - a study of object life span and GC.
In Proceedings of 21st IEEE International Performance, Computing and
Communications Conference (IPCCC), Phoenix, AZ, April 2002.
[yang04] Ting Yang, Emery D. Berger, Matthew Hertz, Scott F. Kaplan, and J. Eliot B.
Moss.
Autonomic heap sizing: Taking real memory into account.
In Bacon and Diwan [ISMM04], 2004, pages 61-72.
Available here.
[yang06] Ting Yang, Emery D. Berger, Scott F. Kaplan, and J. Eliot B. Moss.
CRAMM: Virtual memory support for garbage-collected applications.
In 7th USENIX Symposium on Operating System Design and
Implementation. USENIX Association, 2006.
Available here.
[yang01] Hongseok Yang.
An example of local reasoning in BI pointer logic: the Schorr-Waite
graph marking algorithm.
In SPACE 2001 [SPACE01], 2001.
Available
here.
[yasu91] Masahiro Yasugi and Akinori Yonezawa.
Towards user (application) language-level garbage collection in
object-oriented concurrent languages.
In Wilson and Hayes [OOPSLA91-gc], 1991.
Available here.
[ye97] Xinfeng Ye and John Keane.
Collecting cyclic garbage in distributed systems.
In International Symposium on Parallel Architectures, Algorithms and
Networks (ISPAN '97), Taipei, Taiwan, December 1997.
Available here.
[yeat97b] Stuart A. Yeates and Michel de Champlain.
Design of a garbage collector using design patterns.
In Christine Mingins, Roger Duke, and Bertrand Meyer, editors, Proceedings
of the Twenty-Fifth Conference of (TOOLS) Pacific., pages 77-92,
Melbourne, 1997. ISE (Interactive Software Engineering).
Available
here.
[yeat97] Stuart A. Yeates and Michel de Champlain.
Design patterns in garbage collection.
In Robert S. Hanmer and Don Roberts, editors, Proceedings of the 4th
Annual Conference on the Pattern Languages of Programs, volume 6
``General Techniques'', Monticello, IL, 2-5 September 1997.
Published as technical report # WUCS-97-34 of Washington University (not peer
reviewed).
Available
here.
[yeat97a] Stuart Yeates.
Design patterns in garbage collection.
Master's thesis, University of Canterbury, Christchurch, New Zealand, June
1997.
Available
here.
[yelo77] L. Yelowitz and A. G. Duncan.
Abstractions, instantiations and proofs of marking algorithms.
ACM SIGPLAN Notices, 12(8):13-21, August 1977.
[yi92] Kwangkeun Yi and Williams Ludwell Harrison III.
Interprocedural data flow analysis for compile-time memory management.
Technical Report 1244, Center for Supercomputing Research and Development,
University of Illinois, August 1992.
[yip91] G. May Yip.
Incremental, generational mostly-copying garbage collection in uncooperative
environments.
Technical Report 91/8, Digital, Western Research Laboratory, June 1991.
Masters Thesis - MIT, Cambridge, MA, 1991.
Available here.
[yong94] V.-F. Yong and J. Naughton amd J.-B. Yu.
Storage reclamation and reorganization in client-server persistent object
stores.
In International Conference on Data Engineering, pages 120-133,
Houston, TX, February 1994.
[yu03] Dachuan Yu, Nadeem A. Hamid, and Zhong Shao.
Building certified libraries for PCC: Dynamic storage allocation.
In ESOP 2003 [ESOP03], 2003, pages 101-127.
Also published in Science of Computer Programming, 50(1-3), March 2004.
[yu08] Zoe C. H. Yu, Francis C. M. Lau, and Cho-Li Wang.
Object co-location and memory reuse for Java programs.
ACM Transactions on Architecture and Code Optimization, 4(4):1-36,
2008.
Available here.
[yu96] W. Yu and A. Cox.
Conservative garbage collection on distributed shared memory system.
In Sixth International Conference on Distributed Computing Systems
ICDCS96, pages 402-410, May 1996.
[yuas85] Taiichi Yuasa and Masumi Hagiya.
Kyoto Common Lisp report.
Technical report, Teikoku Insatsu Publishing, Kyoto, 1985.
[yuas90] Taichi Yuasa.
Real-time garbage collection on general-purpose machines.
Journal of Systems and Software, 11(3):181-198, 1990.
[yuas92] Taichi Yuasa.
Memory management and garbage collection of an extended Common Lisp
system for massively parallel SIMD architecture.
In Bekkers and Cohen [IWMM92], 1992.
[yuas02] Taichi Yuasa.
Return barrier.
In Proceedings of the International Lisp Conference 2002, 2002.
[yuha86] M. Yuhara, A. Hattori, M. Niwa, M. Kishimoto, and H. Hayashi.
Evaluation of the Facom Alpha Lisp machine..
In 13th Annual International Symposium on Computer Architecture -
Conference Proceedings. Tokyo, 1986 June 2-5. IEEE Press, 1986.
[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