Article

CRAMM: virtual memory support for garbage-collected applications

Authors:

Ting Yang,

Emery D. Berger,

Scott F. Kaplan,

J. Eliot B. MossAuthors Info & Claims

OSDI '06: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7

Page 8

Published: 06 November 2006 Publication History

Publisher Site

Abstract

Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performance of garbage-collected applications is sensitive to heap size. Larger heaps reduce the frequency of garbage collections, making them run several times faster. However, if the heap is too large to fit in the available RAM, garbage collection can trigger thrashing. Existing Java virtual machines attempt to adapt their application heap sizes to fit in RAM, but suffer performance degradations of up to 94% when subjected to bursts of memory pressure.

We present CRAMM (Cooperative Robust Automatic Memory Management), a system that solves these problems. CRAMM consists of two parts: (1) a new virtual memory system that collects detailed reference information for (2) an analytical model tailored to the underlying garbage collection algorithm. The CRAMM virtual memory system tracks recent reference behavior with low overhead. The CRAMM heap sizing model uses this information to compute a heap size that maximizes throughput while minimizing paging. We present extensive empirical results demonstrating CRAMM's ability to maintain high performance in the face of changing application and system load.

Cited By

View all

Cameron CSinger JVengerov D(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesACM SIGPLAN Notices10.1145/2887746.275418050:11(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754180
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
Cameron CSinger JVengerov DHosking ABond M(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754180(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754180
Show More Cited By

Index Terms

CRAMM: virtual memory support for garbage-collected applications
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Software and its engineering
  1. Software creation and management
    1. Software verification and validation
      1. Operational analysis
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Allocation / deallocation strategies
        Garbage collection
        Virtual memory

Recommendations

CRAMM: virtual memory support for garbage-collected applications
OSDI '06: Proceedings of the 7th symposium on Operating systems design and implementation

Existing virtual memory systems usually work well with applications written in C and C++, but they do not provide adequate support for garbage-collected applications. The performance of garbage-collected applications is sensitive to heap size. Larger ...
Mark-copy: fast copying GC with less space overhead
OOPSLA '03: Proceedings of the 18th annual ACM SIGPLAN conference on Object-oriented programing, systems, languages, and applications

Copying garbage collectors have a number of advantages over non-copying collectors, including cheap allocation and avoiding fragmentation. However, in order to provide completeness (the guarantee to reclaim each garbage object eventually), standard ...
Mark-copy: fast copying GC with less space overhead
Special Issue: Proceedings of the OOPSLA '03 conference

Copying garbage collectors have a number of advantages over non-copying collectors, including cheap allocation and avoiding fragmentation. However, in order to provide completeness (the guarantee to reclaim each garbage object eventually), standard ...

Comments

Information & Contributors

Information

Published In

OSDI '06: Proceedings of the 7th USENIX Symposium on Operating Systems Design and Implementation - Volume 7

November 2006

53 pages

Publisher

USENIX Association

United States

Publication History

Published: 06 November 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

22
Total Citations
View Citations
7
Total Downloads

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

Reflects downloads up to 03 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cameron CSinger JVengerov D(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesACM SIGPLAN Notices10.1145/2887746.275418050:11(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2887746.2754180
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
Cameron CSinger JVengerov DHosking ABond M(2015)The judgment of forseti: economic utility for dynamic heap sizing of multiple runtimesProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754180(143-156)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754180
Kuszmaul BHosking ABond M(2015)SuperMalloc: a super fast multithreaded malloc for 64-bit machinesProceedings of the 2015 International Symposium on Memory Management10.1145/2754169.2754178(41-55)Online publication date: 14-Jun-2015
https://dl.acm.org/doi/10.1145/2754169.2754178
White DSinger JAitken JJones R(2013)Control theory for principled heap sizingACM SIGPLAN Notices10.1145/2555670.246648148:11(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2555670.2466481
White DSinger JAitken JJones RCheng PPetrank E(2013)Control theory for principled heap sizingProceedings of the 2013 international symposium on memory management10.1145/2491894.2466481(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2491894.2466481
White DSinger JAitken JJones RCheng PPetrank E(2013)Control theory for principled heap sizingProceedings of the 2013 international symposium on memory management10.1145/2464157.2466481(27-38)Online publication date: 20-Jun-2013
https://dl.acm.org/doi/10.1145/2464157.2466481
Gu XDing C(2011)On the theory and potential of LRU-MRU collaborative cache managementACM SIGPLAN Notices10.1145/2076022.199348546:11(43-54)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/2076022.1993485
Gu XDing CBoehm HBacon D(2011)On the theory and potential of LRU-MRU collaborative cache managementProceedings of the international symposium on Memory management10.1145/1993478.1993485(43-54)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/1993478.1993485
Singer JJones RBrown GLuján M(2010)The economics of garbage collectionACM SIGPLAN Notices10.1145/1837855.180666945:8(103-112)Online publication date: 5-Jun-2010
https://dl.acm.org/doi/10.1145/1837855.1806669
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations