the Garbage Collection Bibliography

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]

N

[naeem09] Nomair A. Naeem and Ondrej Lhoták. Efficient alias set analysis using SSA form. In Kolodner and Steele [ISMM09], 2009, pages 79-88. Available here.

[naga88] Jiro Naganuma, Takeshi Ogura, Shin-ichiro Yamada, and Takashi Kimura. High-speed CAM-based architecture for a Prolog machine (ASCA). IEEE Transactions on Computers, 37(11):1375-1383, 11 1988.

[naga09] Vijay Nagarajan, Dennis Jeffrey, and Rajiv Gupta. Self-recovery in server programs. In Kolodner and Steele [ISMM09], 2009, pages 49-58. Available here.

[naka88] Katsuto Nakajima. Piling GC: Efficient garbage collection for Al languages. ICOT technical report TR-354, Institute for New Generation Computer Technology, 1988.

[naka88a] Katsuto Nakajima. Piling GC: Efficient garbage collection for Al languages. In IFIP WG 10.3 Working Conference on Parallel Processing, pages 210-204. North Holland, 1988.

[nakl06] C. Nakhli, C. Rippert, G. Salagnac, and S. Yovine. Efficient region-based memory management for resource-limited real-time embedded systems. In Olivier Zendra, editor, Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems (ICOOOLPS'2006), page 8, Nantes, France, July 2006. Available here.

[nand05] V. Krishna Nandivada and David Detlefs. Compile-time concurrent marking write barrier removal. In Proceedings of 3rd IEEE/ACM International Symposium on Code Generation and Oprimization (CGO 2005), pages 37-48, San Jose, CA, March 2005. Available here.

[neel96] Michael S. Neely. An analysis of the effects of memory allocation policy on storage fragmentation. Master's thesis, University of Texas at Austin, 1996. Available here.

[neir87] Anne Neirynck, Prakash Panangaden, and Alan J. Demers. Computation of aliases and support sets. In POPL 1987 [POPL87], 1987, pages 274-283.

[neir88] Anne Neirynck. Static Analysis of Aliasing and Side Effects in Higher-Order Languages. PhD thesis, Cornell University, January 1988.

[nels83] Greg Nelson. Verifying reachability invariants of linked structures. In POPL 1983 [POPL83], 1983, pages 38-47.

[nels89] Jeffrey E. Nelson. Automatic, incremental, on-the-fly garbage collection of actors. Master's thesis, Virginia Polytechnic Institute and State University, 1989.

[neth04] Nicholas Nethercote and Jeremy Fitzhardinge. Bounds-checking entire programs without recompiling. In SPACE 2004 [SPACE04], 2004. Available here.

[nett92] Scott M. Nettles, James W. O'Toole, David Pierce, and Nicholas Haines. Replication-based incremental copying collection. In Bekkers and Cohen [IWMM92], 1992. Available here.

[nett93b] Scott M. Nettles, James W. O'Toole, and David Gifford. Concurrent garbage collection of persistent heaps. Technical Report MIT/LCS/TR-569 and CMU-CS-93-137, Computer Science Department, Carnegie-Mellon University, April 1993. The same paper as [otoo93a]. Available here.

[nett93] Scott Nettles and James O'Toole. Real-time replication-based garbage collection. In PLDI 1993 [PLDI93], 1993, pages 217-226. Available here.

[nett93c] Scott M. Nettles and James W. O'Toole. Implementing orthogonal persistence: A simple optimization based on replicating collection. In IWOOOS 1993 [IWOOOS93], 1993.

[nett96] Scott M. Nettles and James W. O'Toole. A rollback technique for implementing persistence by reachability. In Connor and Nettles [POS96], 1997.

[nett92a] Scott M. Nettles. A Larch specification of copying garbage collection. Research paper CMU-CS-92-219, School of Computer Science, Carnegie Mellon University, December 1992. Available here.

[newe57] A. Newell and J. C. Shaw. Programming the logic theory machine. In Proceedings of the Western Joint Computing Conference, pages 230-240, 1957.

[newe60] A. Newell and F. M. Tonge. An introduction to information processing language V. Communications of the ACM, 3(4):205-211, April 1960.

[newm82a] I. A. Newman, R. P. Stallard, and M. C. Woodward. Alternative approaches to multiprocessor garbage collection. In Proceedings of the International Conference on Parallel Processing, pages 205-210. IEEE Press, August 1982.

[newm82] I. A. Newman, R. P. Stallard, and M. C. Woodward. Performance of parallel garbage collection algorithms. Computer Studies, 166, September 1982.

[newm83] I. A. Newman, R. P. Stallard, and M. C. Woodward. Improved multiprocessor garbage collection algorithms. In Proceedings of the International Conference on Parallel Processing, pages 367-368. IEEE Press, August 1983.

[newm84] I. A. Newman, R. P. Stallard, and M. C. Woodward. A parallel compaction algorithm for multiprocessor garbage collection. In M. Feilmeier, J. Joubert, and U. Schendel, editors, Proceedings of Parallel Computing 83 Conference, pages 450-462, 1984.

[newm87] I. A. Newman, R. P. Stallard, and M. C. Woodward. A hybrid multiple processor garbage collection algorithm. Computer Journal, 30(2):119-127, 1987.

[ng87] Y. H. Ng and R. J. Glover. Basic memory support for functional languages. In 1987 Proceedings - Fourth International IEEE VLSI Multilevel Interconnection Conference. Santa Clara, June 15-16, pages 35-40. IEEE Press, 1987.

[ng96] T.C.T. Ng. Efficient garbage collection for large object-oriented databases. Master's thesis, MIT Laboratory for Computer Science, 1996.

[nguy07] Huu Hai Nguyen and Martin Rinard. Detecting and eliminating memory leaks using early phase termination. In Morrisett and Sagiv [ISMM07], 2007, pages 15-30. Available here.

[niel77] Norman R. Nielsen. Dynamic memory allocation in computer simulation. Communications of the ACM, 20(11):864-873, November 1977.

[nikh00] R.S. Nikhil and U. Ramachandran. Garbage collection of timestamped data in Stampede. In Proceedings of 19th Annual Symposium on Principles of Distributed Computing (PODC 2000), July 2000.

[nils95a] Kelvin Nilsen and H. Gao. The real-time behaviour of dynamic memory management in C++. In IEEE Real-Time Technologies and Applications Symposium, pages 142-153, Chicago, May 1995. IEEE Press. Available here.

[nils90] Kelvin D. Nilsen and William J. Schmidt. Hardware support for garbage collection of linked objects and arrays in real-time. In Jul and Juul [OOPSLA90-gc], 1990. Available here.

[nils90a] Kelvin D. Nilsen and William J. Schmidt. A high-level overview of hardware assisted real-time garbage collection. Technical Report TR90-18a, Iowa State University, Department of Computer Science, October 1990.

[nils92c] Kelvin D. Nilsen and William J. Schmidt. Cost-effective object-space management for hardware-assisted real-time garbage collection. Letters on Programming Language and Systems, 1(4):338-354, December 1992. Available here.

[nils92] Kelvin D. Nilsen and William J. Schmidt. Hardware-assisted general-purpose garbage collection for hard real-time systems. Technical Report ISU TR92-15, Iowa State University, Department of Computer Science, October 1992. Available here.

[nils92a] Kelvin D. Nilsen and William J. Schmidt. Preferred embodiment of a hardware-assisted garbage collection system. Technical Report ISU TR92-17, Iowa State University, Department of Computer Science, November 1992. Available here.

[nils93a] Kelvin D. Nilsen and William J. Schmidt. Cost-effective object-space management for hardware-assisted real-time garbage collection. Letters on Programming Languages and Systems, 1(4):338-354, December 1993.

[nils94a] Kelvin D. Nilsen and William J. Schmidt. A high-performance hardware-assisted real time garbage collection system. Journal of Programming Languages, 2(1), 1994. Available here.

[nils87] Kelvin D. Nilsen. Real-time garbage collection of strings and linked data structures. Technical Report TR 87-5, University of Arizona, Department of Computer Science, January 1987.

[nils88] Kelvin D. Nilsen. Garbage collection of strings and linked data-structures in real-time. Software Practice and Experience, 18(7):613-640, 1988.

[nils91] Kelvin D. Nilsen. A high-performance architecture for real-time garbage collection. In Wilson and Hayes [OOPSLA91-gc], 1991. Available here.

[nils92b] Kelvin D. Nilsen. Memory cycle accountings for hardware-assisted real-time garbage collection. Technical Report 91-21(c), Iowa State University, Computer Science Department, 1992. Available here.

[nils93] Kelvin D. Nilsen. Reliable real-time garbage collection of C++. In Moss et al. [OOPSLA93-gc], 1993. Available here.

[nils94] Kelvin D. Nilsen. Cost-effective hardware-assisted real-time garbage collection. In LCT-RTS 1994 [LCTES94], 1994. Available here.

[nils94b] Kelvin D. Nilsen. Reliable real-time garbage collection of C++. Computing Systems, 7(4), 1994. Available here.

[nils95b] Kelvin Nilsen. High-level dynamic memory management for object oriented real-time systems. In Workshop on Object-Oriented Real-Time Systems, San Antonio, Tx., October 1995. Available here.

[nils95] Kelvin Nilsen. Progress in hardware-assisted real-time garbage collection. In Baker [IWMM95], 1995.

[nils96b] Kelvin Nilsen. Invited note: Java for real-time. Real-Time Systems Journal, pages 197-205, September 1996. Available here.

[nils96] Kelvin Nilsen. Issues in the design and implementation of real-time Java. Java Developer's Journal, 1(1):44, June 1996. Available here.

[nils96a] Kelvin Nilsen. Starting to PERC. Java Developer's Journal, 1(2):11, July 1996. Available here.

[nils98] Kelvin Nilsen. Adding real-time capabilities to the Java programming language. Communications of the ACM, 1998. To appear.

[nils09] Kelvin Nilsen. Differentiating features of the PERC virtual machine. White paper, Aonix, 2009. Available here.

[ning06] Zhang Ning and Guangze Xiong. Minimizing GC work by analysis of live objects. ACM SIGPLAN Notices, 41(3):20-29, March 2006. Available here.

[nish98a] Gor Nishanov and Sibylle Schupp. Design and implementation of the fgc garbage collector. Technical Report 98-7, Rensselaer Polytechnic Institute, NY, 1998. Extended version (1 December 1999) available. Available here.

[nish98] Gor Nishanov and Sibylle Schupp. Garbage collection in generic libraries. In Peyton~Jones and Jones [ISMM98], 1999, pages 86-96.

[nish88] Kenji Nishida, Yasunori Kimura, and A. Matsumoto. Evaluation of the effect of incremental garbage collection by MRB on FGHC parallel execution performance. ICOT technical report TR-394, Institute for New Generation Computer Technology, June 1988.

[nish88a] Kenji Nishida, Yasunori Kimura, A. Matsumoto, and A. Goto. Evaluation of MRB garbage collection on parallel logic programming architectures. In 7th International Conference on Logic Programming, Jerualem, pages 83-95. MIT Press, June 1988.

[nish06] Susumu Nishimura. Verifying data-parallel programs with separation logic. In SPACE 2006 [SPACE06], 2006, pages 101-104. Available here.

[nitz91] B. Nitzberg and V. Lo. Distributed shared memory: A survey of issues and algorithms. IEEE Computer, pages 52-60, 1991.

[niwa86] M. Niwa, M. Yuhara, K. Hayashi, and A. Hattori. Garbage collector with area optimization for FACOM ALPHA.. In COMPCON Spring 86: Thirty-First IEEE Computer Society International Conference. San Francisco, 1986 March 3-6. IEEE Press, 1986.

[nobl00] James Noble, Charles Weir, and Duane Bibby. Small Memory Software: Patterns for Systems with Limited Memory. Addison-Wesley, 2000.

[norc03] Stuart Norcross, Ron Morrison, David S. Munro, and Henry Detmold. Implementing a family of distributed garbage collectors. In Proceedings of the 2003 Australasian Computer Science Conference, (ACSC2003), pages 161-170, Adelaide, January 2003.

[norc03a] Stuart Norcross. Deriving Distributed Garbage Collectors for Distributed Termination Algorithms. PhD thesis, St Andrews University, 2003.

[nori79] A. K. Nori. A storage reclamation system for an applicative multiprocessor system. Master's thesis, University of Utah, Salt Lake City, Utah, 1979.

[nort87] S. C. North and John H. Reppy. Concurrent garbage collection on stock hardware. In Kahn [FPCA87], 1987, pages 113-133.

[nova06] Gene Novark, Trevor Strohman, and Emery D. Berger. Custom object layout for garbage-collected languages. Technical report, University of Massachusetts at Amherst, 2006. NEPLS, March, 2006. Available here.

[nova09] Gene Novark, Emery Berger, and Benjamin Zorn. Efficiently and precisely locating memory leaks and bloat. In PLDI 2009 [PLDI09], 2009.

[nuth89] Peter R. Nuth and Robert H. Halstead. A study of LISP on a multiprocessor (preliminary version). Lisp Pointers, 2(3-4):15-32, 1989.

[nuth87] Peter R. Nuth. Communication patterns in a symbolic multiprocessor. Technical Report MIT/LCS/TR-395, MIT Laboratory for Computer Science, June 1987.

Up [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