Abstract
Regional garbage collection is scalable, with theoretical worst-case bounds for gc latency, MMU, and throughput that are independent of mutator behavior and the volume of reachable storage. Regional collection improves upon the worst-case pause times and MMU seen in most other general-purpose collectors, including garbage-first and concurrent mark/sweep collectors.
- Andrew W. Appel. Compiling with Continuations, chapter 16, pages 205--214. Cambridge University Press, 1992.Google Scholar
- Andrew W. Appel, John R. Ellis, and Kai Li. Real-time concurrent collection on stock multiprocessors. ACM SIGPLAN Notices, 23(7):11--20, 1988. Google Scholar
Digital Library
- David F. Bacon, Perry Cheng, and V.T. Rajan. Controlling fragmentation and space consumption in the Metronome, a real-time garbage collector for Java. In LCTES {30}, pages 81--92. Google Scholar
Digital Library
- David F. Bacon, Perry Cheng, and V.T. Rajan. A real-time garbage collecor with low overhead and consistent utilization. In Conference Record of the Thirtieth Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices, New Orleans, LA, January 2003. ACM Press. Google Scholar
Digital Library
- Henry G. Baker. List processing in real-time on a serial computer. Communications of the ACM, 21(4):280--94, 1978. Also AI Laboratory Working Paper 139, 1977. Google Scholar
Digital Library
- Henry G. Baker. The Treadmill, real-time garbage collection without motion sickness. ACM SIGPLAN Notices, 27(3):66--70, March 1992. Google Scholar
Digital Library
- Ori Ben-Yitzhak, Irit Goft, Elliot Kolodner, Kean Kuiper, and Victor Leikehman. An algorithm for parallel incremental compaction. In David Detlefs, editor, ISMM'02 Proceedings of the Third International Symposium on Memory Management, ACM SIGPLAN Notices, pages 100--105, Berlin, June 2002. ACM Press. Google Scholar
Digital Library
- Peter B. Bishop. Computer Systems with a Very Large Address Space and Garbage Collection. PhD thesis, MIT Laboratory for Computer Science, May 1977. Technical report MIT/LCS/TR-178.Google Scholar
- Stephen M. Blackburn, Richard Jones, Kathryn S. McKinley, and J. Eliot B. Moss. Beltway: Getting around garbage collection gridlock. In PLDI {33}, pages 153--164. Google Scholar
Digital Library
- Guy E. Blelloch and Perry Cheng. On bounding time and space for multiprocessor garbage collection. In Proceedings of SIGPLAN 1999 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, pages 104--117, Atlanta, May 1999. ACM Press. Google Scholar
Digital Library
- Hans-Juergen Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. ACM SIGPLAN Notices, 26(6):157--164, 1991. Google Scholar
Digital Library
- Rodney A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Guy L. Steele, editor, Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming, pages 256--262, Austin, TX, August 1984. ACM Press. Google Scholar
Digital Library
- C. J. Cheney. A non-recursive list compacting algorithm. Communications of the ACM, 13(11):677--8, November 1970. Google Scholar
Digital Library
- Perry Cheng and Guy Blelloch. A parallel, real-time garbage collector. In Proceedings of SIGPLAN 2001 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, pages 125--136, Snowbird, Utah, June 2001. ACM Press. Google Scholar
Digital Library
- Cliff Click, Gil Tene, and Michael Wolf. The pauseless gc algorithm. In Proceedings of the 1st ACM/USENIX international conference on Virtual execution environments, VEE '05, pages 46--56, New York, NY, USA, 2005. ACM. Google Scholar
Digital Library
- William D. Clinger, Anne H. Hartheimer, and Eric M. Ost. Implementation strategies for first-class continuations. Higher-Order and Symbolic Computation, 12(1):7--45, April 1999. Google Scholar
Digital Library
- William D. Clinger and Felix S. Klock. Scalable garbage collection with guaranteed MMU. In Proceedings of the 2009 Workshop on Scheme and Functional Programming, pages 14--25, 2009. Online at http://www.cesura17.net/~will/Professional.Google Scholar
- David Detlefs. A hard look at hard real-time garbage collection. In Proceedings of 7th IEEE International Symposium on Object-oriented Real-time Distributed Computing, May 2004.Google Scholar
Cross Ref
- David Detlefs, William D. Clinger, Matthias Jacob, and Ross Knippel. Concurrent remembered set refinement in generational garbage collection. In Usenix Java Virtual Machine Research and Technology Symposium (JVM '02), San Francisco, CA, August 2002. Google Scholar
Digital Library
- David Detlefs, Christine Flood, Steven Heller, and Tony Printezis. Garbage-first garbage collection. In Amer Diwan, editor, ISMM'04 Proceedings of the Fourth International Symposium on Memory Management, Vancouver, October 2004. ACM Press. Google Scholar
Digital Library
- Edsgar W. Dijkstra, Leslie Lamport, A. J. Martin, C. S. Scholten, and E. F. M. Steffens. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11):965--975, November 1978. Google Scholar
Digital Library
- Niels Hallenberg, Martin Elsman, and Mads Tofte. Combining region inference and garbage collection. In PLDI {33}, pages 141--152. Google Scholar
Digital Library
- Lars Thomas Hansen and William D. Clinger. An experimental study of renewal-older-first garbage collection. In Proceedings of the 2002 ACM SIGPLAN International Conference on Functional Programming (ICFP02), volume 37(9) of ACM SIGPLAN Notices, pages 247--258, Pittsburgh, PA, 2002. ACM Press. Google Scholar
Digital Library
- Roger Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund Institute of Technology, July 1998.Google Scholar
- R. Hieb, R. K. Dybvig, and C. Bruggeman. Representing control in the presence of first-class continuations. ACM SIGPLAN Notices, 25(6):66--77, 1990. Google Scholar
Digital Library
- Richard L. Hudson and J. Eliot B. Moss. Incremental garbage collection for mature objects. In Yves Bekkers and Jacques Cohen, editors, Proceedings of International Workshop on Memory Management, volume 637 of Lecture Notes in Computer Science, University of Massachusetts, USA, 16-18 September 1992. Springer-Verlag. Google Scholar
Digital Library
- Richard Jones and Rafael Lins. Garbage collection: algorithms for automatic dynamic memory management. John Wiley & Sons, Inc., New York, NY, USA, 1996. Google Scholar
Digital Library
- Felix S. Klock. Scalable Garbage Collection via Remembered Set Summarization and Refinement. PhD thesis, Northeastern University, January 2011. Online at http://www.larcenists.org/research.html. Google Scholar
Digital Library
- Martin Larose and Marc Feeley. A compacting incremental collector and its performance in a production quality compiler. In ISMM '98: Proceedings of the 1st international symposium on Memory management, pages 1--9, New York, NY, USA, 1998. ACM. Google Scholar
Digital Library
- ACM SIGPLAN 2003 Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES'2003), San Diego, CA, June 2003. ACM Press.Google Scholar
- Henry Lieberman and Carl Hewitt. A real-time garbage collector based on the lifetimes of objects. Commun. ACM, 26(6):419--429, 1983. Google Scholar
Digital Library
- Scott M. Nettles and James W. O'Toole. Real-time replication-based garbage collection. In Proceedings of SIGPLAN'93 Conference on Programming Languages Design and Implementation, volume 28(6) of ACM SIGPLAN Notices, Carnegie Mellon University, USA, June 1993. ACM Press. Google Scholar
Digital Library
- Proceedings of SIGPLAN 2002 Conference on Programming Languages Design and Implementation, ACM SIGPLAN Notices, Berlin, June 2002. ACM Press.Google Scholar
- Tony Printezis and David Detlefs. A generational mostly-concurrent garbage collector. In Tony Hosking, editor, ISMM 2000 Proceedings of the Second International Symposium on Memory Management, volume 36(1) of ACM SIGPLAN Notices, Minneapolis, MN, October 2000. ACM Press. Google Scholar
Digital Library
- Sven Gestegard Robertz and Roger Henriksson. Time-triggered garbage collection: robust and adaptive real-time gc scheduling for embedded systems. In LCTES {30}, pages 93--102.Google Scholar
- Narendran Sachindran and Eliot Moss. MarkCopy: Fast copying GC with less space overhead. In OOPSLA'03 ACM Conference on Object-Oriented Systems, Languages and Applications, ACM SIGPLAN Notices, Anaheim, CA, November 2003. ACM Press. Google Scholar
Digital Library
- Darko Stefanović, Matthew Hertz, Stephen M. Blackburn, Kathryn S. Mckinley, J. Eliot, and B. Moss. Older-first garbage collection in practice: Evaluation in a java virtual machine. In In Memory System Performance, pages 25--36. ACM Press, 2002. Google Scholar
Digital Library
- Gil Tene, Balaji Iyengar, and Michael Wolf. C4: the continuously concurrent compacting collector. In Proceedings of the international symposium on Memory management, ISMM '11, pages 79--88, New York, NY, USA, 2011. ACM. Google Scholar
Digital Library
- Mads Tofte and Lars Birkedal. A region inference algorithm. ACM Transactions on Programming Languages and Systems, 20(4):734--767, July 1998. Google Scholar
Digital Library
- Mads Tofte and Jean-Pierre Talpin. Region-based memory management. Information and Computation, February 1997. Google Scholar
Digital Library
- David M. Ungar. Generation scavenging: A non-disruptive high performance storage reclamation algorithm. ACM SIGPLAN Notices, 19(5):157--167, April 1984. Also published as ACM Software Engineering Notes 9, 3 (May 1984) - Proceedings of the ACM/SIGSOFT/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, 157--167, April 1984. Google Scholar
Digital Library
- Taichi Yuasa. Real-time garbage collection on general-purpose machines. Journal of Systems and Software, 11(3):181--198, 1990. Google Scholar
Digital Library
Index Terms
Bounded-latency regional garbage collection
Recommendations
Bounded-latency regional garbage collection
DLS '11: Proceedings of the 7th symposium on Dynamic languagesRegional garbage collection is scalable, with theoretical worst-case bounds for gc latency, MMU, and throughput that are independent of mutator behavior and the volume of reachable storage. Regional collection improves upon the worst-case pause times ...
Age-based garbage collection
Modern generational garbage collectors look for garbage among the young objects, because they have high mortality; however, these objects include the very youngest objects, which clearly are still live. We introduce new garbage collection algorithms, ...
Garbage collection hints
HiPEAC'05: Proceedings of the First international conference on High Performance Embedded Architectures and CompilersThis paper shows that Appel-style garbage collectors often make suboptimal decisions both in terms of when and how to collect. We argue that garbage collection should be done when the amount of live bytes is low (in order to minimize the collection cost)...







Comments