Memory Allocation with Lazy Fits

Dynamic memory allocation is an important part of modern programming languages. It is important that it be done fast without wasting too much memory. Memory allocation using lazy fits is introduced, where pointer increments, which is very fast, is used as the primary allocation method and where conventional fits such as best fit or first fit are used as backup. Some experimental results showing how lazy fits might perform are shown, and shows that the approach has the potential to be useful in actual systems.

• Type: Conference
• Year: 2000
• Where: IWMM
• Authors: Yoo C. Chung, Soo-Mook Moon
• Keywords: Dynamic Memory Allocation, Hardware, IWMM 2000, Lazy Fits, Memory Allocation