The memory fragmentation problem

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

[1]  Benjamin G. Zorn,et al.  The measured cost of conservative garbage collection , 1993, Softw. Pract. Exp..

[2]  Paul R. Wilson,et al.  Dynamic Storage Allocation: A Survey and Critical Review , 1995, IWMM.

[3]  David R. Hanson.  Fast allocation and deallocation of memory based on object lifetimes , 1990, Softw. Pract. Exp..

[4]  Benjamin G. Zorn,et al.  Memory allocation costs in large C and C++ programs , 1994, Softw. Pract. Exp..

[5]  Paul R. Wilson,et al.  Non-compacting memory allocation and real-time garbage collection , 1997 .

[6]  Ivor P. Page,et al.  Improving the Performance of Buddy Systems , 1986, IEEE Transactions on Computers.

[7]  Dirk Grunwald,et al.  Empirical measurements of six allocation-intensive C programs , 1992, SIGP.

[8]  George O. Collins,et al.  Experience in automatic storage allocation , 1961, Commun. ACM.

[9]  James L. Peterson,et al.  Buddy systems , 1977, CACM.

[10]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

[11]  Philip J. Fleming,et al.  How not to lie with statistics: the correct way to summarize benchmark results , 1986, CACM.

[12]  Kenneth C. Knowlton,et al.  A fast storage allocator , 1965, CACM.

[13]  Randal E. Bryant,et al.  COSMOS: a compiled simulator for MOS circuits , 1987, DAC '87.

[14]  David A. Patterson,et al.  Computer Architecture: A Quantitative Approach , 1969 .

[15]  Thomas A. Standish.  Data Structure Techniques , 1980 .