skip to main content
10.1145/2491956.2491973acmconferencesArticle/Chapter ViewAbstractPublication PagespldiConference Proceedingsconference-collections
research-article

Limitations of partial compaction: towards practical bounds

Published: 16 June 2013 Publication History

Abstract

Compaction of a managed heap is considered a costly operation, and is avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blow up. Previous study of compaction limitation provided some initial asymptotic bounds but no implications for practical systems. In this work, we extend the theory to obtain better bounds and make them strong enough to become meaningful for modern systems.

References

[1]
D. Abuaiadh, Y. Ossia, E. Petrank, and U. Silbershtein. An efficient parallel heap compaction algorithm. In OOPSLA 2004.
[2]
D. F. Bacon, P. Cheng, and V. Rajan. A real-time garbage collector with low overhead and consistent utilization. In POPL 2003.
[3]
O. Ben-Yitzhak, I. Goft, E. Kolodner, K. Kuiper, and V. Leikehman. An algorithm for parallel incremental compaction. In ISMM 2002.
[4]
A. Bendersky and E. Petrank. Space overhead bounds for dynamic memory management with partial compaction. POPL 2011.
[5]
H.-J. Boehm. Bounding space usage of conservative garbage collectors. In POPL 2002.
[6]
H.-J. Boehm. The space cost of lazy reference counting. POPL 2004.
[7]
C. Click, G. Tene, and M. Wolf. The Pauseless GC algorithm. VEE 2005.
[8]
D. Detlefs, C. Flood, S. Heller, and T. Printezis. Garbage-first garbage collection. In ISMM 2004.
[9]
R. Jones, A. Hosking, and E. Moss. The Garbage Collection Handbook: The Art of Automatic Memory Management. Chapman & Hall, Aug. 2011.
[10]
H. Kermany and E. Petrank. The Compressor: Concurrent, incremental and parallel compaction. In PLDI 2006.
[11]
E. Petrank and D. Rawitz. The hardness of cache conscious data placement. In POPL 2002.
[12]
F. Pizlo, E. Petrank, and B. Steensgaard. A study of concurrent real-time garbage collectors. In PLDI 2008.
[13]
N. Cohen and E. Petrank. Limitations of Partial Compaction: Towards Practical Bounds. http://www.cs.technion.ac.il/%7eerez/%50apers/compaction-full.pdf.
[14]
J. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 21 (3): 491--499, 1974.
[15]
J. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the ACM, 18 (3): 416--423, 1971.

Cited By

View all
  • (2022)Study of Energy-Efficient Optimization Techniques for High-Level Homogeneous Resource ManagementWireless Communications and Mobile Computing10.1155/2022/19535102022(1-12)Online publication date: 27-Jul-2022
  • (2019)Mesh: compacting memory management for C/C++ applicationsProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314582(333-346)Online publication date: 8-Jun-2019
  • (2018)Object-oriented recovery for non-volatile memoryProceedings of the ACM on Programming Languages10.1145/32765232:OOPSLA(1-22)Online publication date: 24-Oct-2018
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation
June 2013
546 pages
ISBN:9781450320146
DOI:10.1145/2491956
  • cover image ACM SIGPLAN Notices
    ACM SIGPLAN Notices  Volume 48, Issue 6
    PLDI '13
    June 2013
    515 pages
    ISSN:0362-1340
    EISSN:1558-1160
    DOI:10.1145/2499370
    Issue’s Table of Contents
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: 16 June 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. compaction
  2. lower bounds
  3. memofragmentation
  4. memory management
  5. theory

Qualifiers

  • Research-article

Conference

PLDI '13
Sponsor:

Acceptance Rates

PLDI '13 Paper Acceptance Rate 46 of 267 submissions, 17%;
Overall Acceptance Rate 406 of 2,067 submissions, 20%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)7
  • Downloads (Last 6 weeks)0
Reflects downloads up to 15 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2022)Study of Energy-Efficient Optimization Techniques for High-Level Homogeneous Resource ManagementWireless Communications and Mobile Computing10.1155/2022/19535102022(1-12)Online publication date: 27-Jul-2022
  • (2019)Mesh: compacting memory management for C/C++ applicationsProceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation10.1145/3314221.3314582(333-346)Online publication date: 8-Jun-2019
  • (2018)Object-oriented recovery for non-volatile memoryProceedings of the ACM on Programming Languages10.1145/32765232:OOPSLA(1-22)Online publication date: 24-Oct-2018
  • (2017)Cost-Oblivious Storage ReallocationACM Transactions on Algorithms10.1145/307069313:3(1-20)Online publication date: 26-May-2017
  • (2016)An Efficient Data Structure for Dynamic Two-Dimensional ReconfigurationProceedings of the 29th International Conference on Architecture of Computing Systems -- ARCS 2016 - Volume 963710.1007/978-3-319-30695-7_23(306-318)Online publication date: 4-Apr-2016
  • (2015)Redundant memory mappings for fast access to large memoriesACM SIGARCH Computer Architecture News10.1145/2872887.274947143:3S(66-78)Online publication date: 13-Jun-2015
  • (2015)MetisProceedings of the 10th Workshop on Implementation, Compilation, Optimization of Object-Oriented Languages, Programs and Systems10.1145/2843915.2843920(1-9)Online publication date: 4-Jul-2015
  • (2015)Reallocation Problems in SchedulingAlgorithmica10.1007/s00453-014-9930-473:2(389-409)Online publication date: 1-Oct-2015
  • (2014)Cost-oblivious storage reallocationProceedings of the 33rd ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems10.1145/2594538.2594548(278-288)Online publication date: 18-Jun-2014
  • (2013)Limitations of partial compactionACM SIGPLAN Notices10.1145/2499370.249197348:6(309-320)Online publication date: 16-Jun-2013
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media