339 views
0 votes
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?

Please log in or register to answer this question.

Related questions

199
views
0 answers
0 votes
admin asked Oct 26, 2019
199 views
One of the first timesharing machines, the $DEC\: PDP-1,$ had a (core) memory of $4K\: 18-bit$ words. It held one process at a time in its memory. When ... any word, rather than only at word $0.$ Why do you suppose this drum was chosen?
398
views
0 answers
1 votes
admin asked Oct 26, 2019
398 views
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 ... cylinders is so large that the chance of two pages being on the same cylinder is negligible.
367
views
0 answers
0 votes
admin asked Oct 26, 2019
367 views
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 ... better than the $\text{LRU, FIFO, or clock} $ algorithms.
773
views
4 answers
1 votes
admin asked Oct 26, 2019
773 views
A machine has $48-bit$ virtual addresses and $32-bit$ physical addresses. Pages are $8\: KB.$ How many entries are needed for a single-level linear page table?