Space overhead bounds for dynamic memory management with partial compaction

Anna Bendersky, Erez Petrank

Research output: Contribution to journalArticlepeer-review

Abstract

Dynamic memory allocation is ubiquitous in today's runtime environments. Allocation and deallocation of objects during program execution may cause fragmentation and foil the program's ability to allocate objects. Robson [1971] has shown that a worst-case scenario can create a space overhead within a factor of log n of the space that is actually required by the program, where n is the size of the largest possible object. Compaction can eliminate fragmentation, but is too costly to be run frequently. Many runtime systems employ partial compaction, in which only a small fraction of the allocated objects are moved. Partial compaction reduces some of the existing fragmentation at an acceptable cost. In this article we study the effectiveness of partial compaction and provide the first rigorous lower and upper bounds on its effectiveness in reducing fragmentation at a low cost.

Original languageEnglish
Article number13
JournalACM Transactions on Programming Languages and Systems
Volume34
Issue number3
DOIs
StatePublished - Oct 2012

Keywords

  • Compaction
  • Dynamic storage allocation
  • Memory management
  • Partial compaction
  • Runtime systems
  • Storage allocation

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Space overhead bounds for dynamic memory management with partial compaction'. Together they form a unique fingerprint.

Cite this