- A modification of the free-list approach is to store the addresses of free blocks in the first free block.
- The first of these blocks are actually free. The last block contains the addresses of another free blocks, and so on.
- The addresses of a large number of free blocks can now be found quickly, unlike the situation when the standard linked-list approach is used.
Cem Ozdogan
2011-02-14