The following diagram shows a memory configuration under dynamic partitioning me

ID: 671600 • Letter: T

Question

The following diagram shows a memory configuration under dynamic partitioning memory management, after a number of placements and swapping-out operations have been carried out. Addresses go from left to right. Gray areas indicate blocks occupied by processes, while white areas indicate free memory blocks. The last process loaded is 4M and is marked with an X. Only one process was swapped out after that.

1-What is the size of the swapped out process? Why?

2-What was the size of the free block just before it was partitioned by X? How?

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 for each of the following placement algorithms:

a.Best fit

b.First fit

c.Next fit

d.Worst fit

4-For this scenario,

a.Which placement algorithm was faster?

b.Which one was slower?

c.Which one caused less fragmentation?

4M 3M 1M 1iMi 2M 5M Addresses

Explanation / Answer

1.
A process is not swapped out until it has finished or some new process come. So, we can't answer that

2.
size of the free block = 1M + size of X + 2M = 1M + 4M + 2M = 7M

3.
a. Best fit:
The new process will occupy the emmpty 3M free memory(6th white block from the beginning).

b. First fit:
The new process will acquire the first white block.

c. Next fit:
The new process woll acquire the 5M free space(4th white block from the beginning).

d. Worst Fit:
It will occupy the largest free block(first white block)

4.
a.
first fit and next fit were fastest.

b.
Best fir and worst fit were slowest.

c.
Best fit