For these questions, assume that memory partitions can be subdivided; multiple processes may fit in a partition if there is room. For example, if we had a 30-MB partition and a 20-MB process that fits in the partition, the partition’s new size is 10 MB after placing the process in it. If a second, 8-MB process arrives, we may place it in the partition, leaving 2 MB free in the partition. (The original memory partition then contains a 10-MB and an 8-MB process.)
Last solution had mistakes:
For these questions, assume that memory partitions can be subdivided; multiple processes may fit in a partition if there is room. For example, if we had a 30-MB partition and a 20-MB process that fits in the partition, the partition’s new size is 10 MB after placing the process in it. If a second, 8-MB process arrives, we may place it in the partition, leaving 2 MB free in the partition. (The original memory partition then contains a 10-MB and an 8-MB process.)
-
Consider a swapping system where memory has partitions of the following sizes: 180 MB, 100 MB, 40 MB, 200 MB, 300 MB, and 150 MB (in order). For first fit, how are processes of sizes 180 MB, 30 MB, 150 MB, 80 MB, 100 MB, and 70 MB placed (in order)? Indicate which requests (if any) cannot be satisfied.
-
Repeat question (a) for best fit.
-
Repeat question (a) for worst fit.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps
