The Gateway to Computer Science Excellence
0 votes

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 repetitions of the sequence $0, 1, \dots , 511$ followed by a random reference to pages $431$ and $332.$

  1. Why will the standard replacement algorithms $(\text{LRU, FIFO, clock})$ not be effective in handling this workload for a page allocation that is less than the sequence length?
  2. If this program were allocated $500$ page frames, describe a page replacement approach that would perform much better than the $\text{LRU, FIFO, or clock} $ algorithms.
in Operating System by Veteran (58.8k points) | 8 views

Please log in or register to answer this question.

Related questions

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
50,737 questions
57,291 answers
104,890 users