Limitations of Partial Compaction: Towards Practical Bounds

被引:9
作者
Cohen, Nachshon
Petrank, Erez
机构
关键词
Memory management; compaction; fragmentation; theory; lower bounds; Algorithms; Theory; Languages; DYNAMIC STORAGE-ALLOCATION;
D O I
10.1145/2499370.2491973
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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.
引用
收藏
页码:309 / 319
页数:11
相关论文
共 15 条
  • [1] Abuaiadh D., OOPSLA 2004
  • [2] Bacon D.F., POPL 2003
  • [3] Ben-Yitzhak O., 2002, ISMM 2002
  • [4] Bendersky A., POPL 2011
  • [5] Boehm H.-J., POPL 2004
  • [6] Boehm H.-J., POPL 2002
  • [7] Click C., 2005, VEE 2005
  • [8] Cohen N., LIMITATIONS PARTIAL
  • [9] Detlefs D., ISMM 2004
  • [10] Jones R., 2011, GARBAGE COLLECTION H