Placement Algorithms for Fixed Partitions

• Equal size partitions

  • Trivial

• Unequal size partitions

  • Multiple queues
    • Assigns each process to the smallest partition within which it fits.
    • Minimizes internal fragmentation.
  • Single queue
    • Assign each process to the smallest available partition within which it fits.
    • Increases the level of multiprogramming on the expense of internal fragmentation.

Operating

System

unequal size

partitioning

Previous slide

Next slide

Back to first slide

View graphic version