Space Overhead Bounds for Dynamic Memory Management with Partial Compaction

作者：Bendersky Anna^*; Petrank Erez

来源：ACM Sigplan Notices, 2011, 46(1): 475-486.

DOI：10.1145/1925844.1926441

• Languages
• Performance
• Algorithms
• Theory
• Runtime systems
• Memory management
• Storage allocation
• Dynamic storage allocation
• Compaction
• Partial compaction

Dynamic memory allocation is ubiquitous in today's runtime environments. Allocation and de-allocation of objects during program execution may cause fragmentation and foil the program's ability to allocate objects. Robson has shown that a worst case scenario can create a space overhead within a factor of logn 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 paper 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.

• 出版日期2011-1