Buddy System
A reasonable compromise between fixed and dynamic partitioning schemes.
Memory blocks are available in size of where L?k?U and where
- = smallest size of block that can be allocated.
- = largest size of block that can be allocated (the entire memory).
The OS maintains several lists of holes
- The i-list has holes of size .
- A pair of available buddies in the i-list are collapsed into a single hole in the i+1 list.