206
Placement Algorithm with Partitions
nUnequal-size
partitions:
use of multiple
queues
uassign each process to the smallest partition within which it
will fit
uA queue for each partition size
utries to minimize internal fragmentation
uProblem: some queues will be empty if no processes within
a size range
is present
