research-article

Handles revisited: optimising performance and memory costs in a real-time collector

Authors:

Tomas Kalibera,

Richard JonesAuthors Info & Claims

ISMM '11: Proceedings of the international symposium on Memory management

Pages 89 - 98

https://doi.org/10.1145/1993478.1993492

Published: 04 June 2011 Publication History

Abstract

Compacting garbage collectors must update all references to objects they move. Updating is a lengthy operation but the updates must be transparent to the mutator. The consequence is that no space can be reclaimed until all references have been updated which, in a real-time collector, must be done incrementally. One solution is to replace direct references to objects with handles. Handles offer several advantages to a real-time collector. They eliminate the updating problem. They allow immediate reuse of the space used by evacuated objects. They incur no copy reserve overhead. However, the execution time overhead of handles has led to them being abandoned by most modern systems.

We re-examine this decision in the context of real-time garbage collection, for which several systems with handles have appeared recently. We provide the first thorough study of the overheads of handles, based on an optimised implementation of different handle designs within Ovm's Minuteman real-time collector. We find that with a good set of optimisations handles are not very expensive. We obtained zero overhead over the widely used Brooks-style compacting collector (1.6% and 3.1% on two other platforms) and 9% increase in memory usage. Our optimisations are particularly applicable to mark-compact collectors, but may also be useful to other collectors.

References

[1]

O. Agesen. Space and time-efficient hashing of garbage-collected objects. Theor. Pract. Object Syst., 5: 119--124, 1999.

Digital Library

[2]

A. Armbruster, J. Baker, et al. A real-time Java virtual machine with applications in avionics. Trans. Embedded Comput. Sys., 7(1), 2007.

Digital Library

[3]

D. F. Bacon, P. Cheng, and V. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Principles of Programming Languages, 2003.

Digital Library

[4]

A. Bendersky and E. Petrank. Space overhead bounds for dynamic memory management with partial compaction. In Principles of Programming Languages, 2011.

Digital Library

[5]

S. Blackburn and K. McKinley. Immix garbage collection: Mutator locality, fast collection, and space efficiency. In Programming Language Design and Implementation, 2008.

[6]

et al.}blac06S. Blackburn, R. Garner, et al. The DaCapo benchmarks: Java benchmarking development and analysis. In Object-Oriented Programming, Systems, Languages, and Applications, 2006.

Digital Library

[7]

G. Bollella, T. Canham, et al. Programming with non-heap memory in the real-time specification for Java. In Object-Oriented Programming, Systems, Languages, and Applications, 2003.

Digital Library

[8]

R. A. Brooks. Trading data space for reduced time and code space in real-time garbage collection on stock hardware. In Lisp and Functional Programming, 1984.

Digital Library

[9]

E. J. Bruno and G. Bollella. Real-Time Java Programming with Java RTS. Prentice Hall, 2009.

Digital Library

[10]

G. Chen, M. Kandemir, et al. Heap compression for memory-constrained Java environments. In Object-Oriented Programming, Systems, Languages, and Applications, 2003.

Digital Library

[11]

C. Click, G. Tene, and M. Wolf. The Pauseless GC algorithm. In Virtual Execution Environments, 2005.

Digital Library

[12]

S. S. Craciunas, C. M. Kirsch, et al. A compacting real-time memory management system. In USENIX, 2008.

Digital Library

[13]

E. W. Dijkstra, L. Lamport, et al. On-the-fly garbage collection: An exercise in cooperation. Communications of the ACM, 21(11). 1978.

Digital Library

[14]

F. Gruian and Z. Salcic. Designing a concurrent hardware garbage collector for small embedded systems. In Asia-Pacific Computer Systems Architecture Conference, 2005.

Digital Library

[15]

B. Hayes. Using key object opportunism to collect old objects. In Object-Oriented Programming, Systems, Languages, and Applications, 1991.

Digital Library

[16]

R. Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund University, 1998.

[17]

C.-H. A. Hsieh, M. T. Conte, et al. Optimizing NET compilers for improved Java performance. Computer, 30, 1997.

Digital Library

[18]

Y. C. Hu, W. Yu, et al. Run-time support for distributed sharing in safe languages. Trans. Comput. Syst., 21, 2003.

Digital Library

[19]

R. L. Hudson and J. E. B. Moss. Sapphire: copying garbage collection without stopping the world. Concurrency and Computation: Practice and Experience, 15(3--5), 2003.

[20]

R. E. Jones and R. Lins. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, 1996.

Digital Library

[21]

T. Kalibera. Replicating real-time garbage collector for Java. In Java Technologies for Real-Time and Embedded Systems, 2009.

Digital Library

[22]

H. Kermany and E. Petrank. The Compressor: Concurrent, incremental and parallel compaction. In Programming Language Design and Implementation, 2006.

Digital Library

[23]

M. Kirkup. Taking out the trash: Garbage collection, 2005. http://us.blackberry.com/devjournals/resources/journals/jan_2005/garbag_collection.jsp.

[24]

G. Krasner, editor. Smalltalk-80: Bits of History, Words of Advice. Addison-Wesley, 1983.

Digital Library

[25]

M. Larose and M. Feeley. A compacting incremental collector and its performance in a production quality compiler. In International Symposium on Memory Management, 1998

Digital Library

[26]

D. J. Lilja. Measuring Computer Performance: A Practitioner's Guide. Cambridge University Press, 2000.

Digital Library

[27]

C.-M. Lin and T.-F. Chen. Dynamic memory management for real-time embedded Java chips. Real-Time Computing Systems and Applications, 2000.

Digital Library

[28]

S. Meloan. The Java HotSpot performance engine: An in-depth look. http://developer.java.sun.com/developer/technicalArticles/Networking/HotSpot/.

[29]

S. Nettles and J. O'Toole. Real-time replication garbage collection. In Programming Language Design and Implementation, 1993.

Digital Library

[30]

K. Nilsen. Differentiating features of the PERC virtual machine. http://www.aonix.com/pdf/PERCWhitePaper_e.pdf, 2009.

[31]

S. C. North and J. H. Reppy. Concurrent garbage collection on stock hardware. In Functional Programming and Computer Architecture, 1987.

Digital Library

[32]

Ovm. The Ovm virtual machine. http://www.ovmj.net.

[33]

S. L. Peyton Jones and R. Jones, editors. International Symposium on Memory Management, 1998.

[34]

P. P. Pirinen. Barrier techniques for incremental tracing. In International Symposium on Memory Management, 1998

Digital Library

[35]

F. Pizlo, L. Ziarek, et al. Schism: fragmentation-tolerant real-time garbage collection. In Programming Language Design and Implementation, 2010.

Digital Library

[36]

M. Schoeberl. Scheduling of hard real-time garbage collection. Real-Time Systems, 45(3), 2010.

Digital Library

[37]

M. Schoeberl, C. Thalinger, et al. Hardware objects for Java. In International Symposium on Object-Oriented Real-Time Distributed Computing, 2008.

Digital Library

[38]

F. Siebert. Realtime garbage collection in the JamaicaVM 3.0. In Java Technologies for Real-time and Embedded Systems, 2007.

Digital Library

[39]

S. Stanchina and M. Meyer. Mark-sweep or copying? a "best of both worlds" algorithm and a hardware-supported real-time implementation. In International Symposium on Memory Management, 2007.

Digital Library

[40]

T. Yuasa. Real-time garbage collection on general-purpose machines. J. Systems and Software, 11(3), 1990.

Digital Library

Cited By

Nanjekye JBremner DMicic AJul ERacordon D(2023)Towards Reliable Memory Management for Python Native ExtensionsProceedings of the 18th ACM International Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems10.1145/3605158.3605849(15-26)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3605158.3605849
Degenbaev UEisinger JHara KHlopko MLippautz MPayer H(2018)Cross-component garbage collectionProceedings of the ACM on Programming Languages10.1145/32765212:OOPSLA(1-24)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276521
Ugawa TRitson CJones R(2018)Transactional SapphireACM Transactions on Programming Languages and Systems10.1145/322622540:4(1-56)Online publication date: 10-Dec-2018
https://dl.acm.org/doi/10.1145/3226225
Show More Cited By

Index Terms

Handles revisited: optimising performance and memory costs in a real-time collector
1. Computer systems organization
  1. Embedded and cyber-physical systems
  2. Real-time systems
2. Software and its engineering
  1. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Garbage collection

Recommendations

Handles revisited: optimising performance and memory costs in a real-time collector
ISMM '11

Compacting garbage collectors must update all references to objects they move. Updating is a lengthy operation but the updates must be transparent to the mutator. The consequence is that no space can be reclaimed until all references have been updated ...
Improved replication-based incremental garbage collection for embedded systems
ISMM '10

We have developed an incremental compacting garbage collector for embedded Java systems. The collector divides the heap into equal sized pages and uses the segregated free lists for fast allocation. Collectors that have such a heap layout have a problem ...
Mark-sweep or copying?: a "best of both worlds" algorithm and a hardware-supported real-time implementation
ISMM '07: Proceedings of the 6th international symposium on Memory management

Copying collectors offer a number of advantages over their mark-sweep counterparts. First, they do not have to deal with mark stacks and potential mark stack overflows. Second, they do not suffer from unpredictable fragmentation overheads since they ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISMM '11: Proceedings of the international symposium on Memory management

June 2011

148 pages

ISBN:9781450302630

DOI:10.1145/1993478

General Chair:
Hans-J. Boehm
HP Labs
,
Program Chair:
David Bacon
IBM T.J. Watson Research

ACM SIGPLAN Notices Volume 46, Issue 11
ISMM '11
November 2011
135 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2076022
Issue’s Table of Contents

Copyright © 2011 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: 04 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISMM '11

Sponsor:

SIGPLAN

ISMM '11: International Symposium on Memory Management

June 4 - 5, 2011

California, San Jose, USA

Acceptance Rates

Overall Acceptance Rate 72 of 156 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
249
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)0

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Nanjekye JBremner DMicic AJul ERacordon D(2023)Towards Reliable Memory Management for Python Native ExtensionsProceedings of the 18th ACM International Workshop on Implementation, Compilation, Optimization of OO Languages, Programs and Systems10.1145/3605158.3605849(15-26)Online publication date: 17-Jul-2023
https://dl.acm.org/doi/10.1145/3605158.3605849
Degenbaev UEisinger JHara KHlopko MLippautz MPayer H(2018)Cross-component garbage collectionProceedings of the ACM on Programming Languages10.1145/32765212:OOPSLA(1-24)Online publication date: 24-Oct-2018
https://dl.acm.org/doi/10.1145/3276521
Ugawa TRitson CJones R(2018)Transactional SapphireACM Transactions on Programming Languages and Systems10.1145/322622540:4(1-56)Online publication date: 10-Dec-2018
https://dl.acm.org/doi/10.1145/3226225
Higuera-Toledano M(2014)Building the Java Heap with Bricks in an Embedded Real-Time EnvironmentProceedings of the 2014 IEEE/ACM 18th International Symposium on Distributed Simulation and Real Time Applications10.1109/DS-RT.2014.16(57-66)Online publication date: 1-Oct-2014
https://dl.acm.org/doi/10.1109/DS-RT.2014.16
de Oliveira APetkovich JReidemeister TFischmeister STůma PCasale GField TAmaral J(2013)DataMillProceedings of the 4th ACM/SPEC International Conference on Performance Engineering10.1145/2479871.2479892(137-148)Online publication date: 21-Apr-2013
https://dl.acm.org/doi/10.1145/2479871.2479892
Ugawa TRitson CJones R(2018)Transactional SapphireACM Transactions on Programming Languages and Systems10.1145/322622540:4(1-56)Online publication date: 10-Dec-2018
https://dl.acm.org/doi/10.1145/3226225
Petkovich JOliveira AZhang YReidemeister TFischmeister S(2016)DataMillSoftware—Practice & Experience10.1002/spe.238246:10(1411-1440)Online publication date: 1-Oct-2016
https://dl.acm.org/doi/10.1002/spe.2382

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