Quote: first-fit with multiple segments, heap of max-sized blocks per segment and linear search/coalesce; 1 word/block, logarithmic time

Quotation Skeleton

We have shown that it is possible to … (plus a few percent of the total space) … not increase linearly with the number of free … the algorithm is straightforward and relatively easy to … Another advantage of the first-fit strategy is that … area, and this space may be used for … [splits memory into even size segments; keeps array heap of max sized block in each segment; keeps array of first block in each segment; uses linear search to locate block and coalesce blocks; block header is its size plus alloc/free flag]   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: memory management by free list (19 items)