Register

Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 34 (Page No. 257)

469 views
0 votes
0 votes

A student has claimed that ‘‘in the abstract, the basic page replacement algorithms (FIFO, LRU, optimal) are identical except for the attribute used for selecting the page to be replaced.’’

  1. What is that attribute for the FIFO algorithm? LRU algorithm? Optimal algorithm?
  2. Give the generic algorithm for these page replacement algorithms.
User Avatar

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
2
admin asked Oct 26, 2019
725 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 32 (Page No. 257)
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
In the $\text{WSClock}$ algorithm of Fig. $3-20(c),$ the hand points to a page with $R = 0.$ If $\tau = 400,$ will this page be removed? What about if $\tau = 1000?$
User Avatar
0 votes
0 votes
0 answers
4
admin asked Oct 26, 2019
434 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 30 (Page No. 257)
A small computer on a smart card has four page frames. At the first clock tick, the $R$ bits are $0111\:\: ($page $0$ is $0,$ the rest are $1).$ ... $8-bit$ counter, give the values of the four counters after the last tick.
A small computer on a smart card has four page frames. At the first clock tick, the $R$ bits are $0111\:\: ($page $0$ is $0,$ the rest are $1).$ At subsequent clock ticks...
User Avatar
Link Copied!