| Memory Management – Policies |
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Policy
examples |
|||||||||||
| – | First
Fit: scan free list and allocate first hole that |
|||||||||||
| is
large enough – fast |
||||||||||||
| – | Next
Fit: start search from end of last allocation |
|||||||||||
| – | Best
Fit: find smallest hole that is adequate – |
|||||||||||
| slower
and lots of fragmentation |
||||||||||||
| – | Worst
fit: find largest hole |
|||||||||||
| – | In
general, First Fit is the winner |
|||||||||||
