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.
- D. Abuaiadh, Y. Ossia, E. Petrank, and U. Silbershtein. An efficient parallel heap compaction algorithm. In OOPSLA 2004. Google Scholar
Digital Library
- D. F. Bacon, P. Cheng, and V. Rajan. A real-time garbage collector with low overhead and consistent utilization. In POPL 2003. Google Scholar
Digital Library
- O. Ben-Yitzhak, I. Goft, E. Kolodner, K. Kuiper, and V. Leikehman. An algorithm for parallel incremental compaction. In ISMM 2002. Google Scholar
Digital Library
- A. Bendersky and E. Petrank. Space overhead bounds for dynamic memory management with partial compaction. POPL 2011. Google Scholar
Digital Library
- H.-J. Boehm. Bounding space usage of conservative garbage collectors. In POPL 2002. Google Scholar
Digital Library
- H.-J. Boehm. The space cost of lazy reference counting. POPL 2004. Google Scholar
Digital Library
- C. Click, G. Tene, and M. Wolf. The Pauseless GC algorithm. VEE 2005. Google Scholar
Digital Library
- D. Detlefs, C. Flood, S. Heller, and T. Printezis. Garbage-first garbage collection. In ISMM 2004. Google Scholar
Digital Library
- R. Jones, A. Hosking, and E. Moss. The Garbage Collection Handbook: The Art of Automatic Memory Management. Chapman & Hall, Aug. 2011. Google Scholar
Digital Library
- H. Kermany and E. Petrank. The Compressor: Concurrent, incremental and parallel compaction. In PLDI 2006. Google Scholar
Digital Library
- E. Petrank and D. Rawitz. The hardness of cache conscious data placement. In POPL 2002. Google Scholar
Digital Library
- F. Pizlo, E. Petrank, and B. Steensgaard. A study of concurrent real-time garbage collectors. In PLDI 2008. Google Scholar
Digital Library
- N. Cohen and E. Petrank. Limitations of Partial Compaction: Towards Practical Bounds. http://www.cs.technion.ac.il/%7eerez/%50apers/compaction-full.pdf. Google Scholar
Digital Library
- J. Robson. Bounds for some functions concerning dynamic storage allocation. Journal of the ACM, 21 (3): 491--499, 1974. Google Scholar
Digital Library
- J. Robson. An estimate of the store size necessary for dynamic storage allocation. Journal of the ACM, 18 (3): 416--423, 1971. Google Scholar
Digital Library
Index Terms
Limitations of partial compaction: towards practical bounds
Recommendations
Limitations of partial compaction: towards practical bounds
PLDI '13: Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and ImplementationCompaction 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 ...
Limitations of Partial Compaction: Towards Practical Bounds
Compaction of a managed heap is a costly operation to be avoided as much as possible in commercial runtimes. Instead, partial compaction is often used to defragment parts of the heap and avoid space blowup. Previous study of compaction limitation ...
Mostly concurrent compaction for mark-sweep GC
ISMM '04: Proceedings of the 4th international symposium on Memory managementA memory manager that does not move objects may suffer from memory <i>fragmentation</i>. <i>Compaction</i> is an efficient, and sometimes inevitable, mechanism for reducing fragmentation. A Mark-Sweep garbage collector must occasionally execute a ...







Comments