CPSC 270 Data Structures

Chapter 23 Optional Topics: Memory Management & External Sorting

| About   «  22.5. Other Spatial Data Structures   ::   Contents   ::   23.2. Buddy Method and Other Memory Allocation Methods  »

Circular First Fit

1. Circular First Fit

A simple variation that will improve performance is, instead of always beginning at the head of the freelist, remember the last position reached in the previous search and start from there. When the end of the freelist is reached, search begins again at the head of the freelist. This modification reduces the number of unnecessary searches through small blocks that were passed over by previous requests.

Now try it for yourself with the following exercise.

   «  22.5. Other Spatial Data Structures   ::   Contents   ::   23.2. Buddy Method and Other Memory Allocation Methods  »

Close Window