skip to main content
research-article

Limitations of partial compaction: towards practical bounds

Published:16 June 2013Publication History
Skip Abstract Section

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

Index Terms

  1. Limitations of partial compaction: towards practical bounds

      Recommendations

      Comments

      Login options

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

      Sign in

      Full Access

      • Published in

        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
        • 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

        Copyright © 2013 ACM

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 16 June 2013

        Check for updates

        Qualifiers

        • research-article

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!