For the page reference string shown in the time sequence bel…
For the page reference string shown in the time sequence below, At what time does the next page fault occur? What page is replaced under LRU? What page is put there? If instead, Optimal is being used, what page is replaced? In what situation would he length of the page fault take twice the time? Time 32 33 34 35 36 37 38 39 40 PRS: 5 6 5 1 6 3 2 6 1 Frame 0 1 Frame 1 5 Frame 2 6
Read DetailsTwo hundred memory units are available to the Operating Syst…
Two hundred memory units are available to the Operating System. Process A is using 50 units and can claim 60. Process B is using 10 units and can claim 30 units. Process C is using 40 units and can claim 60. Process D is using 80 units and can claim 100. Process A requests an additional 20 units. Can the Operating System grant the request? Why? Show all your work. You may assume you are currently in a safe state.
Read DetailsAssume we are dealing with a system that places programs in…
Assume we are dealing with a system that places programs in memory following a first-fit dynamic partitioning scheme. At some point in time, we have just loaded a program that needed 48 MB, and memory is as depicted below (not to scale). Shaded (blue) regions are full, blanks are holes (with sizes in megabytes as indicated); the cross-hatched region is the location of the most recently loaded program, it is at least 48 MB in size. Show, on the memory diagram, where the following sequence of new programs will be positioned and the resultant holes. The programs require in order 32MB, 7 MB, 10 MB, 5 MB, and 35 MB of memory. Show memory at each modification.
Read Details