The memory fragmentation problem
Mark S. Johnstone, Paul R. Wilson · International Symposium on Memory Management · 1998
We show that for 8 real and varied C and C++ programs, several conventional dynamic storage allocators provide near-zero fragmentation, once we account for overheads due to implementation details such as headers, alignment, etc. This substantially strengthens our previous results showing that the memory fragmentation problem has generally been misunderstood, and that good allocator policies can provide good memory usage for most programs. The new results indicate that for most programs, excellent allocator policies are readily available, and efficiency of implementation is the major challenge. While we believe that our experimental results are state-of-the-art and our methodology is superior to most previous work, more work should be done to identify and study unusual problematic program behaviors not represented in our sample.
Cited by 199 works. doi:10.1145/286860.286864
Authors
References
- The Art of Computer Programming
- Computer Architecture: A Quantitative Approach
- The Art of Computer Programming. Volume 1: Fundamental Algorithms.
- Fundamental Algorithms
- Computer architecture (2nd ed.): a quantitative approach
- A fast storage allocator
- Dynamic storage allocation: A survey and critical review
- How not to lie with statistics: the correct way to summarize benchmark results
- COSMOS: a compiled simulator for MOS circuits
- Data structure techniques