|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
n |
Unequal-size
|
|
|
partitions:
use of
|
|
|
multiple
queues
|
|
|
|
u |
assign each
process to
|
|
|
the smallest
partition
|
|
|
|
within which it
will fit
|
|
|
|
u |
A queue for each
|
|
|
partition size
|
|
|
|
u |
tries to minimize
|
|
|
internal
fragmentation
|
|
|
|
u |
Problem: some
queues
|
|
will be empty if
no
|
|
|
|
processes within
a size
|
|
range is present
|
|
|
|
|
|