The memory fragmentation problem: solved?
The memory fragmentation problem: solved?
复制标题
DOI：
10.1145/286860.286864
复制
发表时间：
1998-10
期刊：
影响因子：
--
通讯作者：
Mark S. Johnstone;P. Wilson
中科院分区：
文献类型：
--
作者：
Mark S. Johnstone;P. Wilson
我们证明，对于8个真实的和变化的C和C++程序，一旦我们考虑到由于头部、对齐等实现细节而产生的开销，几个传统的动态存储分配器提供了接近于零的碎片。这大大加强了我们之前的结果，该结果表明内存碎片问题通常被误解，并且好的分配器策略可以为大多数程序提供良好的内存使用。新的结果表明，对于大多数程序来说，优秀的分配器策略是现成的，执行效率是主要挑战。虽然我们相信我们的实验结果是最先进的，我们的方法优于大多数以前的工作，但还需要做更多的工作来识别和研究我们的样本中没有代表的不寻常的有问题的程序行为。
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.