Information AboutFree List |
| CATEGORIES ABOUT FREE LIST | |
| memory management | |
|
Free lists make the allocation and deallocation operations very simple. To free a region, we just add it to the free list. To allocate a region, we simply remove a single region from the end of the free list and use it. If the regions are variable-sized, we may have to search for a region of large enough size, which can be expensive. Free lists have the disadvantage, inherited from linked lists, of poor Locality Of Reference and so poor Data Cache utilization, and they provide no way of consolidating adjacent regions to fulfill allocation requests for large regions, unlike the Buddy Allocation System . Nevertheless, they're still useful in a variety of simple applications where a full-blown memory allocator is unnecessary or requires too much overhead. REFERENCES
|
|
|