Article

Program-level adaptive memory management

Authors:

Chengliang Zhang,

Mitsunori OgiharaAuthors Info & Claims

ISMM '06: Proceedings of the 5th international symposium on Memory management

Pages 174 - 183

https://doi.org/10.1145/1133956.1133979

Published: 10 June 2006 Publication History

Abstract

Most application's performance is impacted by the amount of available memory. In a traditional application, which has a fixed working set size, increasing memory has a beneficial effect up until the application's working set is met. In the presence of garbage collection this relationship becomes more complex. While increasing the size of the program's heap reduces the frequency of collections, collecting a heap with memory paged to the backing store is very expensive. We first demonstrate the presence of an optimal heap size for a number of applications running on a machine with a specific configuration. We then introduce a scheme which adaptively finds this good heap size. In this scheme, we track the memory usage and number of page faults at a program's phase boundaries. Using this information, the system selects the soft heap size. By adapting itself dynamically, our scheme is independent of the underlying main memory size, code optimizations, and garbage collection algorithm. We present several experiments on real applications to show the effectiveness of our approach. Our results show that program-level heap control provides up to a factor of 7.8 overall speedup versus using the best possible fixed heap size controlled by the virtual machine on identical garbage collectors.

References

[1]

R. Alonso and A. W. Appel. Advisor for flexible working sets. In Proceedings of the 1990 ACM Sigmetrics Conference on Measurement and Modeling of Computer Systems, pages 153--162, Boulder, CO, May 1990.

Digital Library

[2]

E. Andreasson, F. Hoffmann, and O. Lindholm. To collect or not to collect? Machine learning for memory management. In JVM '02: Proceedings of the Java Virtual Machine Research and Technology Symposium, August 2002.

Digital Library

[3]

D. F. Bacon, P. Cheng, and V. T. Rajan. A real-time garbage collector with low overhead and consistent utilization. In Thirtieth, New Orleans, LA, Jan. 2003.

Digital Library

[4]

R. Balasubramonian, D. Albonesi, A. Buyuktosunoglu, and S. Dwarkadas. Memory hierarchy reconfiguration for energy and performance in general-purpose processor architectures. In Proceedings of the 33rd International Symposium on Microarchitecture, Monterey, California, December 2000.

Digital Library

[5]

D. Buytaert, K. Venstermans, L. Eeckhout, and K. D. Bosschere. Garbage collection hints. In Proceedings of HIPEAC'05. Lecture Notes in Computer Science Volume 3793, Springer-Verlag, November 2005.

Digital Library

[6]

F. Chen, S. Jiang, and X. Zhang. CLOCK-Pro: an effective improvement of the CLOCK replacement. In Proceedings of USENIX Annual Technical Conference, 2005.

Digital Library

[7]

S. P. E. Corporation. Specjbb2000. http://www.spec.org/jbb2000/docs/userguide.html.

[8]

S. P. E. Corporation. Specjvm98 documentation, Mar. 1999.

[9]

C. Ding, C. Zhang, X. Shen, and M. Ogihara. Gated memory control for memory monitoring, leak detection and garbage collection. In Proceedings of the 3rd ACM SIGPLAN Workshop on Memory System Performance, Chicago, IL, June 2005.

Digital Library

[10]

A. Georges, D. Buytaert, L. Eeckhout, and K. D. Bosschere. Method-level phase behavior in Java workloads. In Proceedings of ACMSIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications, October 2004.

Digital Library

[11]

M. Hertz, Y. Feng, and E. D. Berger. Garbage collection without paging. In PLDI '05: Proceedings of the 2005 ACM SIGPLAN Conference On Programming Language Design and Implementation, pages 143--153, New York, NY, USA, 2005. ACM Press.

Digital Library

[12]

C.-H. Hsu and U. Kremer. The design, implementation and evaluation of a compiler algorithm for CPU energy reduction. In Proceedings of ACM SIGPLAN Conference on Programming Language Design and Implementation, San Diego, CA, June 2003.

Digital Library

[13]

M. Huang, J. Renau, and J. Torrellas. Positional adaptation of processors: application to energy reduction. In Proceedings of the International Symposium on Computer Architecture, San Diego, CA, June 2003.

Digital Library

[14]

S. Jiang and X. Zhang. TPF: a dynamic system thrashing protection facility. Software Practice and Experience, 32(3), 2002.

Digital Library

[15]

J. Lau, E. Perelman, and B. Calder. Selecting software phase markers with code structure analysis. Technical Report CS2004-0804, UCSD, November 2004. conference version to appear in CGO'06.

Digital Library

[16]

G. Magklis, M. L. Scott, G. Semeraro, D. H. Albonesi, and S. Dropsho. Profile-based dynamic voltage and frequency scaling for a multiple clock domain microprocessor. In Proceedings of the International Symposium on Computer Architecture, San Diego, CA, June 2003.

Digital Library

[17]

J. E. B. Moss, K. S. McKinley, S. M. Blackburn, E. D. Berger, A. Daiwan, A. Hosking, D. Stefanovic, and C. Weems. The dacapo project. Technical report, 2004.

[18]

X. Shen, C. Ding, S. Dwarkadas, and M. L. Scott. Characterizing phases in service-oriented applications. Technical Report TR 848, Department of Computer Science, University of Rochester, November 2004.

[19]

Y. Smaragdakis, S. Kaplan, and P. Wilson. The EELRU adaptive replacement algorithm. Perform. Eval., 53(2):93--123, 2003.

Digital Library

[20]

S. Soman, C. Krintz, and D. F. Bacon. Dynamic selection of application-specific garbage collectors. In ISMM '04: Proceedings of the 4th international symposium on Memory management, New York, NY, USA, 2004. ACM Press.

Digital Library

[21]

R. Vallée-Rai, L. Hendren, V. Sundaresan, P. Lam, E. Gagnon, and P. Co. Soot - a java optimization framework. In Proceedings of CASCON 1999, pages 125--135, 1999.

Digital Library

[22]

T. Yang, M. Hertz, E. D. Berger, S. F. Kaplan, and J. E. B. Moss. Automatic heap sizing: taking real memory into account. In ISMM'04: Proceedings of the 4th international symposium on Memory management, pages 61--72, New York, NY, USA, 2004. ACM Press.

Digital Library

[23]

P. Zhou, V. Pandey, J. Sundaresan, A. Raghuraman, Y. Zhou, and S. Kumar. Dynamic tracking of page miss ratio curve for memory management. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems, Boston, MA, USA, October 2004.

Digital Library

Cited By

Tavakolisomeh SShimchenko MÖsterlund EBruno RFerreira PWrigstad TBruno RMoss E(2023)Heap Size Adjustment with CPU ControlProceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes10.1145/3617651.3622988(114-128)Online publication date: 19-Oct-2023
https://dl.acm.org/doi/10.1145/3617651.3622988
Kirisame MShenoy PPanchekha P(2022)Optimal heap limits for reducing browser memory useProceedings of the ACM on Programming Languages10.1145/35633236:OOPSLA2(986-1006)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563323
Chiu MMoss ETilevich EMössenböck H(2018)Run-time program-specific phase prediction for python programsProceedings of the 15th International Conference on Managed Languages & Runtimes10.1145/3237009.3237011(1-10)Online publication date: 12-Sep-2018
https://dl.acm.org/doi/10.1145/3237009.3237011
Show More Cited By

Index Terms

Program-level adaptive memory management
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
  2. Software organization and properties
    1. Contextual software domains
      1. Operating systems
        Memory management
        Garbage collection

Recommendations

Automatic heap sizing: taking real memory into account
ISMM '04: Proceedings of the 4th international symposium on Memory management

Heap size has a huge impact on the performance of garbage collected applications. A heap that barely meets the application's needs causes excessive GC overhead, while a heap that exceeds physical memory induces paging. Choosing the best heap size <i>a ...
Garbage collection without paging
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Garbage collection offers numerous software engineering advantages, but interacts poorly with virtual memory managers. Existing garbage collectors require far more pages than the application's working set and touch pages without regard to which ones are ...
Quantifying the performance of garbage collection vs. explicit memory management
Proceedings of the 20th annual ACM SIGPLAN conference on Object oriented programming systems languages and applications

Garbage collection yields numerous software engineering benefits, but its quantitative impact on performance remains elusive. One can compare the cost of conservative garbage collection to explicit memory management in C/C++ programs by linking in an ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

ISMM '06: Proceedings of the 5th international symposium on Memory management

June 2006

202 pages

ISBN:1595932216

DOI:10.1145/1133956

General Chair:
Erez Petrank
Technion - Israel Institute of Technology
,
Program Chair:
Eliot Moss
University of Massachusetts, Amherst

Copyright © 2006 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

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 10 June 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

ISMM06

Sponsor:

ISMM06: The 2006 International Symposium on Memory Management

June 10 - 11, 2006

Ontario, Ottawa, Canada

Acceptance Rates

Overall Acceptance Rate 72 of 156 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

37
Total Citations
View Citations
587
Total Downloads

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

Reflects downloads up to 13 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Tavakolisomeh SShimchenko MÖsterlund EBruno RFerreira PWrigstad TBruno RMoss E(2023)Heap Size Adjustment with CPU ControlProceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes10.1145/3617651.3622988(114-128)Online publication date: 19-Oct-2023
https://dl.acm.org/doi/10.1145/3617651.3622988
Kirisame MShenoy PPanchekha P(2022)Optimal heap limits for reducing browser memory useProceedings of the ACM on Programming Languages10.1145/35633236:OOPSLA2(986-1006)Online publication date: 31-Oct-2022
https://dl.acm.org/doi/10.1145/3563323
Chiu MMoss ETilevich EMössenböck H(2018)Run-time program-specific phase prediction for python programsProceedings of the 15th International Conference on Managed Languages & Runtimes10.1145/3237009.3237011(1-10)Online publication date: 12-Sep-2018
https://dl.acm.org/doi/10.1145/3237009.3237011
Chiu MMarlin BMoss EZheng YBinder WTůma P(2016)Real-Time Program-Specific Phase Change Detection for Java ProgramsProceedings of the 13th International Conference on Principles and Practices of Programming on the Java Platform: Virtual Machines, Languages, and Tools10.1145/2972206.2972221(1-11)Online publication date: 29-Aug-2016
https://dl.acm.org/doi/10.1145/2972206.2972221
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
Vogt DMiraglia APortokalidis GBos HTanenbaum AGiuffrida CLea RGopalakrishnan STilevich EMurphy ABlackstock M(2015)Speculative Memory CheckpointingProceedings of the 16th Annual Middleware Conference10.1145/2814576.2814802(197-209)Online publication date: 24-Nov-2015
https://dl.acm.org/doi/10.1145/2814576.2814802
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
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
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