Log In
0 votes
A student in a compiler design course proposes to the professor a project of writing a compiler that will produce a list of page references that can be used to implement the optimal page replacement algorithm. Is this possible? Why or why not? Is there anything that could be done to improve paging efficiency at run time?
in Operating System 34 views

Please log in or register to answer this question.

Related questions

1 vote
0 answers
How long does it take to load a $64-KB$ program from a disk whose average seek time is $5\: msec,$ whose rotation time is $5 msec,$ and whose tracks hold $1\: MB$ for a $2-KB$ page size? for a $4-KB$ page size? The pages are spread randomly around the disk and the number of cylinders is so large that the chance of two pages being on the same cylinder is negligible.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 49 views
0 votes
0 answers
Suppose that the virtual page reference stream contains repetitions of long sequences of page references followed occasionally by a random page reference. For example, the sequence$: 0, 1, \dots, 511, 431, 0, 1, \dots , 511, 332, 0, 1, \dots$ consists of ... $500$ page frames, describe a page replacement approach that would perform much better than the $\text{LRU, FIFO, or clock} $ algorithms.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 80 views
1 vote
4 answers