- Consider A Dynamic Partitioning Swapping System In Which Memory Consists Of 640kbytes As Shown Below Hole 1 P2 Hole 2 P 1 (205.26 KiB) Viewed 24 times
Consider a dynamic partitioning swapping system in which memory consists of 640KBytes as shown below: Hole 1 P2 Hole 2 P3 Hole 3 P5 Hole 4 P7 Hole 5 P9 Hole 6 Where Hole1 = 80 KB, Hole2 = 75 KB, Hole3 = 40 KB, Hole4 = 45 KB, Hole5 = 65 KB, Hole6 = 30 KB indicate the unused memory partitions. Note that P2, P3, P5, P7 and P9 are the processes in memory. Assume that process P3 was just swapped into memory and new processes arrive in the order P10, P11, P12, P13, P14 and are of size 20KB, 65KB, 50KB, 10KB and 45KB, respectively. How would each of the first-fit, next-fit and best-fit algorithms place processes of P10, P11, P12, P13 and P14?