A process has been allocated 4 pages of physical RAM while its virtual address space consists...

 

Transcribed Image Text:

A process has been allocated 4 pages of physical RAM while its virtual address space consists of 8 pages. It makes accesses to (virtual) pages in the following order: 0, 1, 2, 3, 4, 5, 2, 1, 3. Assuming there are no pages in RAM when the process starts, how many page faults would the above access pattern result in: • if least recently used (LRU) page replacement policy was used to replace pages, and • if an optimal algorithm was used (i.e., the one that knows all future accesses). LRU: 4, Optimal: 4 LRU: 8, Optimal: 6 LRU: 4, Optimal: 2 LRU: 4, Optimal: 0 LRU: 7, Optimal: 4 A process has been allocated 4 pages of physical RAM while its virtual address space consists of 8 pages. It makes accesses to (virtual) pages in the following order: 0, 1, 2, 3, 4, 5, 2, 1, 3. Assuming there are no pages in RAM when the process starts, how many page faults would the above access pattern result in: • if least recently used (LRU) page replacement policy was used to replace pages, and • if an optimal algorithm was used (i.e., the one that knows all future accesses). LRU: 4, Optimal: 4 LRU: 8, Optimal: 6 LRU: 4, Optimal: 2 LRU: 4, Optimal: 0 LRU: 7, Optimal: 4

Answer rating: 100% (QA)

The detailed answer for the above question is provided below Lets analyze the access patt... View the full answer