CSC 553 - Operating Systems

Dr. R. M. Siegfried

Assignment #7 - p. 333/7.2, 7.6

Due Tuesday, October 24, 2023

7.2

Consider a fixed partitioning scheme with equal-size partitions of 2 16 bytes and a total memory size of 224 bytes. A process table is maintained that includes a pointer to a partition for each resident process. How many bits are required for the pointer?

Problem 7.6

This diagram shows an example of memory configuration under dynamic partitioning, after a number of placement and swapping-out operations have been carried out. Addresses go from left to right; gray areas indicate blocks occupied by processes; white areas indicate free memory blocks. The last process placed is 2 MBytes and is marked with an X. Only one process was swapped after that.

  1. What is the maximum size of the swapped out process?
  2. What was the size of the free block just before it was partitioned by X?
  3. A new 3-MByte allocation request must be satisfied next. Indicate the intervals of memory where a partition will be created for the new process under the following four placement algorithms: best-fit, first-fit, next-fir, worst-fit. For each algorithm, draw a horizontal segment under the memory strip and label it clearly.

[Back to the Assignments Index]