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

@article{CohenP17,
  title = {Limitations of Partial Compaction},
  author = {Nachshon Cohen and Erez Petrank},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {39},
  number = {1},
  year = {2017},
  doi = {10.1145/2994597}
}