 |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| ä |
The
overhead to keep track of small holes will
|
|
|
|
be
substantially larger than the hole itself.
|
|
|
| ä |
The
best-fit is slower than the first-fit because it
|
|
|
must
search the entire list.
|
|
|
| ä |
The
best-fit tends to fill up memory with tiny
|
|
|
|
useless
holes.
|
|
|
| ä |
The
first-fit generates larger holes on average
|
|
|
| ä |
Simulation
have shown that the first-fit and the
|
|
|
|
best-fit
give better results, with the first-fit
|
|
|
|
being
faster.
|
|
|
| ä |
To
speed up these algorithms, we can maintain
|
|
|
|
separate
lists for processes and holes
|
|
|
| ä |
To
make the best-fit faster, we can maintain the
|
|
|
|
hole
list by size.
|
|
