Operating SystemsTU Board 2078
Why OPR is best but not pratically fessible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3,…
Why OPR is best but not pratically fessible page replacement algorithm? Calculate the number of page faults for OPR, LRU and Clock page replacement algorithm for the reference string: 1, 3, 4, 2, 3, 5, 4, 3, 1, 2, 4, 6, 3, 2, 1, 4, 2. Assume the memory size is 3.
A worked answer is on its wayMeanwhile, read the Operating Systems notes for this topic.
Discussion
Loading…
More Operating Systems questions
Discuss about single level and two level directory system. Consider the following process and answer the following questions. Process Allocation Max Available…TU Board 207910When does race condition occur in inter process communication? What does busy waiting mean and how it can be handled using sleep and wakeup strategy?TU Board 207910Define shell and system call. suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 95, and there is a queue of…TU Board 207910Distinguish between starvation and deadlock . How does the system schedule process using multiple queues?TU Board 20795List any two demerits of disabling interrupt to achieve mutual exclusion. Describe about fixed and variable partitioningTU Board 20795For the following dataset, compute average waiting time for SRTN and SJF. Process Arrival Time Burst Time P0 0 7 P1 2 4 P2 4 1 P3 5 4TU Board 20795