research-article

Tracing garbage collection on highly parallel platforms

Authors:

Katherine Barabash,

Erez PetrankAuthors Info & Claims

ISMM '10: Proceedings of the 2010 international symposium on Memory management

Pages 1 - 10

https://doi.org/10.1145/1806651.1806653

Published: 05 June 2010 Publication History

Abstract

The pervasiveness of multiprocessor and multicore hardware and the rising level of available parallelism are radically changing the computing landscape. Can software deal with tomorrow's potential higher parallelism? In this paper we study this issue from the garbage collection perspective. In particular, we investigate the scalability of parallel heap tracing, which stands at the core of the garbage collection activity. Heap shapes can be sequential in nature, and prevent the collector from scaling the trace. We start by proposing the idealized trace utilization as a scalability measure for evaluating the scalability of a given heap shape. We then examine standard Java benchmarks and evaluate the existence of non-scalable object-graph shapes in their execution. Next, we propose and implement a prototype of garbage collection techniques that attempt to ameliorate the object-graph shape problem. Finally, we measure and report their efficacy.

References

[1]

Spec: The standard performance evaluation corporation. http://www.spec.org.

[2]

Bowen Alpern, Dick Attanasio, John J. Barton, M. G. Burke, Perry Cheng, J.-D. Choi, Anthony Cocchi, Stephen J. Fink, David Grove, Michael Hind, Susan Flynn Hummel, D. Lieber, V. Litvinov, Mark Mergen, Ton Ngo, J. R. Russell, Vivek Sarkar, Manuel J. Serrano, Janice Shepherd, S. Smith, V. C. Sreedhar, H. Srinivasan, and J. Whaley. The Jalapeño virtual machine. IBM Systems Journal, 39(1), February 2000.

Digital Library

[3]

Hezi Azatchi, Yossi Levanoni, Harel Paz, and Erez Petrank. An on-the-fly mark and sweep garbage collector based on sliding view. In OOPSLA, 2003.

Digital Library

[4]

David F. Bacon, Clement R. Attanasio, Han Bok Lee, V. T. Rajan, and Stephen E. Smith. Java without the coffee breaks: A nonintrusive multiprocessor garbage collector. In PLDI 2001 {27}, pages 92--103.

Digital Library

[5]

David F. Bacon, Perry Cheng, and V.T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Conference Record of the Thirtieth Annual ACM Symposium on Principles of Programming Languages, ACM SIGPLAN Notices 38(1), New Orleans, LA, USA, January 2003.

Digital Library

[6]

Katherine Barabash, Ori Ben-Yitzhak, Irit Goft, Elliot K. Kolodner, Victor Leikehman, Yoav Ossia, Avi Owshanko, and Erez Petrank. A parallel, incremental, mostly concurrent garbage collector for servers. ACM Transactions on Programming Languages and Systems, 27(6):1097--1146, November 2005.

Digital Library

[7]

Stephen Blackburn, Robin Garner, Kathryn S. McKinley, Amer Diwan, Samuel Z. Guyer, Antony Hosking, J. Eliot B. Moss, and Darko Stefanović. The DaCapo benchmarks: Java benchmarking development and analysis. In OOPSLA, 2006.

Digital Library

[8]

Stephen M. Blackburn, Perry Cheng, and Kathryn S. McKinley. Oil and water? High performance garbage collection in Java with MMTk. In Proceedings of the 26th International Conference on Software Engineering, pages 137--146, Edinburgh, May 2004.

Digital Library

[9]

Hans-Juergen Boehm, Alan J. Demers, and Scott Shenker. Mostly parallel garbage collection. ACM SIGPLAN Notices, 26(6):157--164, 1991.

Digital Library

[10]

Craig Chambers and Antony L. Hosking, editors. Proceedings of the Second International Symposium on Memory Management, ACM SIGPLAN Notices 36(1), Minneapolis, MN, October 2000.

[11]

Perry Cheng and Guy Blelloch. A parallel, real-time garbage collector. In PLDI 2001 {27}, pages 125--136.

Digital Library

[12]

Cliff Click. Private communication.

[13]

Cliff Click, Gil Tene, and MichaelWolf. The Pauseless GC algorithm. In Michael Hind and Jan Vitek, editors, Proceedings of the First ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments, pages 46--56, Chicago, IL, USA, June 2005.

Digital Library

[14]

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.

Digital Library

[15]

Damien Doligez and Georges Gonthier. Portable, unobtrusive garbage collection for multiprocessor systems. In Conference Record of the Twenty-First Annual ACM Symposium on Principles of Programming Languages, Portland, OR, USA, January 1994. ACM Press.

Digital Library

[16]

Damien Doligez and Xavier Leroy. A concurrent generational garbage collector for a multi-threaded implementation of ML. In Conference Record of the Twentieth Annual ACM Symposium on Principles of Programming Languages, pages 113--123, Charleston, SC, USA, January 1993. ACM Press.

Digital Library

[17]

Tamar Domani, Elliot K. Kolodner, Ethan Lewis, Elliot E. Salant, Katherine Barabash, Itai Lahan, Erez Petrank, Igor Yanover, and Yossi Levanoni. Implementing an on-the-fly garbage collector for Java. In Chambers and Hosking {10}, pages 155--166.

[18]

Tamar Domani, Elliot K. Kolodner, and Erez Petrank. A generational on-the-fly garbage collector for Java. In PLDI, 2000.

Digital Library

[19]

Toshio Endo, Kenjiro Taura, and Akinori Yonezawa. A scalable marksweep garbage collector on large-scale shared-memory machines. In Proceedings of High Performance Computing and Networking (SC'97), 1997.

Digital Library

[20]

Toshio Endo, Kenjiro Taura, and Akinori Yonezawa. Predicting scalability of parallel garbage collectors on shared memory multiprocessors. In IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium, page 43, Washington, DC, USA, 2001. IEEE Computer Society.

Digital Library

[21]

Toshio Endo, Kenjiro Taura, and Akinori Yonezawa. Reducing pause time of conservative collectors. In Hans-J. Boehm and David Detlefs, editors, Proceedings of the Third International Symposium on Memory Management (June, 2002), ACM SIGPLAN Notices 38(2 supplement), pages 12--24, Berlin, Germany, February 2003.

Digital Library

[22]

Christine Flood, Dave Detlefs, Nir Shavit, and Catherine Zhang. Parallel garbage collection for shared memory multiprocessors. In Proceedings of the First Java Virtual Machine Research and Technology Symposium, Monterey, CA, USA, April 2001. USENIX.

Digital Library

[23]

Richard L. Hudson and J. Eliot B. Moss. Sapphire: Copying GC without stopping the world. In Joint ACM Java Grande -- ISCOPE 2001 Conference, Stanford University, CA, June 2001.

Digital Library

[24]

Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.

Digital Library

[25]

Yossi Levanoni and Erez Petrank. An on-the-fly reference counting garbage collector for Java. In OOPSLA, 2001.

Digital Library

[26]

Filip Pizlo, Erez Petrank, and Bjarne Steensgaard. A study of concurrent real-time garbage collectors. In PLDI, 2008.

Digital Library

[27]

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, ACM SIGPLAN Notices 36(5), Snowbird, UT, USA, June 2001.

[28]

Tony Printezis and David Detlefs. A generational mostly-concurrent garbage collector. In Chambers and Hosking {10}, pages 143--154.

[29]

Yefim Shuf, Manish Gupta, Hubertus Franke, Andrew Appel, and Jaswinder Pal Singh. Creating and preserving locality of Java applications at allocation and garbage collection times. In OOPSLA, 2002.

Digital Library

[30]

Fridtjof Siebert. Limits of parallel marking collection. In Richard Jones and Steve Blackburn, editors, Proceedings of the Seventh International Symposium on Memory Management, pages 21--29, Tucson, AZ, USA, June 2008. ACM Press.

Digital Library

[31]

Guy L. Steele. Multiprocessing compactifying garbage collection. Communications of the ACM, 18(9):495--508, September 1975.

Digital Library

[32]

Guy L. Steele. Corrigendum: Multiprocessing compactifying garbage collection. Communications of the ACM, 19(6):354, June 1976.

[33]

Herb Sutter. The free lunch is over: A fundamental turn toward concurrency in software. http://www.gotw.ca/publications/concurrency-ddj.htm, March 2005.

[34]

Ming Wu and Xiao-Feng Li. Task-pushing: a scalable parallel GC marking algorithm without synchronization operations. In IEEE International Parallel and Distribution Processing Symposium (IPDPS) 2007, Long Beach, CA, March 2007.

Cited By

Huang CBlackburn SCai ZBruno RMoss E(2023)Improving Garbage Collection Observability with Performance TracingProceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes10.1145/3617651.3622986(85-99)Online publication date: 19-Oct-2023
https://dl.acm.org/doi/10.1145/3617651.3622986
Zhao WBlackburn SMcKinley KJhala RDillig I(2022)Low-latency, high-throughput garbage collectionProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523440(76-91)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523440
Wagner GLarsen PBrunthaler SFranz M(2016)Thinking Inside the BoxACM Transactions on Programming Languages and Systems10.1145/286657638:3(1-37)Online publication date: 8-Apr-2016
https://dl.acm.org/doi/10.1145/2866576
Show More Cited By

Index Terms

Tracing garbage collection on highly parallel platforms
1. Information systems
  1. Information storage systems
    1. Storage management
2. Software and its engineering
  1. Software notations and tools
    1. Compilers
    2. General programming languages
      1. Language types
        Object oriented languages
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        File systems management
        Memory management

Recommendations

Garbage-first garbage collection
ISMM '04: Proceedings of the 4th international symposium on Memory management

<i>Garbage-First</i> is a server-style garbage collector, targeted for multi-processors with large memories, that meets a soft real-time goal with high probability, while achieving high throughput. Whole-heap operations, such as global marking, are ...
Tracing garbage collection on highly parallel platforms
ISMM '10

The pervasiveness of multiprocessor and multicore hardware and the rising level of available parallelism are radically changing the computing landscape. Can software deal with tomorrow's potential higher parallelism? In this paper we study this issue ...
An on-the-fly mark and sweep garbage collector based on sliding views
Special Issue: Proceedings of the OOPSLA '03 conference

With concurrent and garbage collected languages like Java and C# becoming popular, the need for a suitable non-intrusive, efficient, and concurrent multiprocessor garbage collector has become acute. We propose a novel mark and sweep on-the-fly algorithm ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISMM '10: Proceedings of the 2010 international symposium on Memory management

June 2010

140 pages

ISBN:9781450300544

DOI:10.1145/1806651

General Chair:
Jan Vitek
Purdue University
,
Program Chair:
Doug Lea
State University of New York at Oswego

ACM SIGPLAN Notices Volume 45, Issue 8
ISMM '10
August 2010
129 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/1837855
Issue’s Table of Contents

Copyright © 2010 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 June 2010

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISMM '10

Sponsor:

SIGPLAN

ISMM '10: International Symposium on Memory Management

June 5 - 6, 2010

Ontario, Toronto, Canada

Acceptance Rates

Overall Acceptance Rate 72 of 156 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

34
Total Citations
View Citations
446
Total Downloads

Downloads (Last 12 months)16
Downloads (Last 6 weeks)1

Reflects downloads up to 28 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Huang CBlackburn SCai ZBruno RMoss E(2023)Improving Garbage Collection Observability with Performance TracingProceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes10.1145/3617651.3622986(85-99)Online publication date: 19-Oct-2023
https://dl.acm.org/doi/10.1145/3617651.3622986
Zhao WBlackburn SMcKinley KJhala RDillig I(2022)Low-latency, high-throughput garbage collectionProceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation10.1145/3519939.3523440(76-91)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519939.3523440
Wagner GLarsen PBrunthaler SFranz M(2016)Thinking Inside the BoxACM Transactions on Programming Languages and Systems10.1145/286657638:3(1-37)Online publication date: 8-Apr-2016
https://dl.acm.org/doi/10.1145/2866576
Kuszmaul B(2015)SuperMalloc: a super fast multithreaded malloc for 64-bit machinesACM SIGPLAN Notices10.1145/2887746.275417850:11(41-55)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754178
Österlund ELöwe W(2015)Concurrent compaction using a field pinning protocolACM SIGPLAN Notices10.1145/2887746.275417750:11(56-69)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754177
Cohen NPetrank E(2015)Data structure aware garbage collectorACM SIGPLAN Notices10.1145/2887746.275417650:11(28-40)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754176
Cohen NPetrank EHosking ABond M(2015)Data structure aware garbage collectorProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754176(28-40)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754176
Rogers TO'Connor MAamodt T(2014)Learning your limitCommunications of the ACM10.1145/268258357:12(91-98)Online publication date: 26-Nov-2014
https://dl.acm.org/doi/10.1145/2682583
Alnowaiser KSinger JKulkarni MHarris T(2014)A study of connected object locality in NUMA heapsProceedings of the workshop on Memory Systems Performance and Correctness10.1145/2618128.2618132(1-9)Online publication date: 13-Jun-2014
https://dl.acm.org/doi/10.1145/2618128.2618132
Libič PBulej LHorky VTůma PLange KMurphy JBinder WMerseguer J(2014)On the limits of modeling generational garbage collector performanceProceedings of the 5th ACM/SPEC international conference on Performance engineering10.1145/2568088.2568097(15-26)Online publication date: 22-Mar-2014
https://dl.acm.org/doi/10.1145/2568088.2568097
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten