Memory Allocation

a) Is it possible to have internal fragmentation with fixed partition memory allocation? Explain.

b) Is it possible to have external fragmentation with fixed partition memory allocation? Explain.

c) Is it possible to have internal fragmentation with dynamic/variable memory partition allocation? Explain.

d) Is it possible to have external fragmentation with dynamic/variable memory partition allocation? Explain.

e) Suppose we have 1000K of memory where the first 100K is reserved. Also suppose that the following processes have been allocated memory in the following order:

P1: 100K, P2: 100K, P3: 25K, P4: 200K, P5: 200K, P6: 75K, P7: 100K.

Create a diagram of memory.

Suppose that P2, P4, and P6 finish and the following processes are on the queue waiting for memory (assume FIFO):

P8: 150K, P9: 25K, P10: 50K, P11: 25K.

Create a diagram of memory for each of the following algorithms showing how the memory would be allocated:

First-Fit

Best-Fit

Worst-Fit.

Notes:

1) Assume that the algorithm starts at the lowest address of memory to determine each new allocation for First-Fit.

2) If there is a tie, that is, two locations in memory where a process could be loaded, use the lower/smaller address.