Question: Using a dynamic partitioning scheme and considering the following memory point in time in Megabytes (M): configuration snapshot at a given 2E 40M 60M 60M
Using a dynamic partitioning scheme and considering the following memory point in time in Megabytes (M): configuration snapshot at a given 2E 40M 60M 60M 40M 30M 40M 40M The shaded red areas are allocated blocks and green areas are free blocks. Three processes Pl, P2, and P3 make the requests for 40M, 20M, and 10M memory, respectively. Show how each of the following placement algorithms allocates the requests by filling out the provided table: a) First-fit E E 40M 60M 60M 40M 30M 40M 40M b) Best-fit E 40M 60M 2 60M 40M 30M 40M40M c) Worse-fit 2 2 40M 60M 2 E 60M 40M 30M 40M 40M
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
