A Memory Management Unit (MMU) of OS with dynamic partition strategy had executed several processes in...

Transcribed Image Text:

A Memory Management Unit (MMU) of OS with dynamic partition strategy had executed several processes in main memory the size of 512KB. Figure 1 shows the main memory with several dynamic partition after Process 2 (P2) been fetch in (swap in). (Note the shaded block is allocated/occupied block). 62K 50K 100K P1 150K P2 Figure 1: Main memory with total 512KB 150K (C3, CO1, PO1) a) Imagine after process 2 (P2) is swap in, process 3 (P3) with the size of 80KB is swap in and follow by process 4 (P4) been fetch in with the size of 45KB. Sketch the main memory partition after P4 is swap in using Best-Fit, Worst-Fit, First-Fit and Next-Fit placement technique. (8 Marks) (C4, CO1, PO1) b) Sketch the main memory partitioning when Buddy System technique is used as placement algorithm for all processes P1, P2, P3 and P4 (in order) as explain previously. Show step by step when the 1st process P1 until P4 is fetch in (swap in) to the main memory. (8 Marks) A Memory Management Unit (MMU) of OS with dynamic partition strategy had executed several processes in main memory the size of 512KB. Figure 1 shows the main memory with several dynamic partition after Process 2 (P2) been fetch in (swap in). (Note the shaded block is allocated/occupied block). 62K 50K 100K P1 150K P2 Figure 1: Main memory with total 512KB 150K (C3, CO1, PO1) a) Imagine after process 2 (P2) is swap in, process 3 (P3) with the size of 80KB is swap in and follow by process 4 (P4) been fetch in with the size of 45KB. Sketch the main memory partition after P4 is swap in using Best-Fit, Worst-Fit, First-Fit and Next-Fit placement technique. (8 Marks) (C4, CO1, PO1) b) Sketch the main memory partitioning when Buddy System technique is used as placement algorithm for all processes P1, P2, P3 and P4 (in order) as explain previously. Show step by step when the 1st process P1 until P4 is fetch in (swap in) to the main memory. (8 Marks)