search
Log In

Recent questions tagged page-replacement

1 vote
2 answers
1
0 votes
1 answer
2
Determine the number of page faults when references to pages occur in the following order: $1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate $3$ pages and the main memory already has the pages $1$ and $2$, with page $1$ having been brought earlier than page $2$.(LRU algorithm is used). $3$ $5$ $4$ None of these.
asked Mar 31 in Operating System Lakshman Patel RJIT 110 views
0 votes
1 answer
3
Working set$(t,k)$ at an instant of time, $t$,is The set of $k$ future references that the operating system will make The set of future references that the operating system will make in the next $'k'$ time units The set of $k$ references with high frequency The set of pages that have been referenced in the last $k$ time units
asked Mar 31 in Operating System Lakshman Patel RJIT 87 views
0 votes
1 answer
4
0 votes
2 answers
5
The total number of page faults for the reference string $1,2,3,4,5,6,7,8,9,10$ using FIFO page replacement policy for a process, if $3$ frames are allocated to it are $9$ $10$ $8$ $11$
asked Mar 30 in Operating System Lakshman Patel RJIT 121 views
2 votes
2 answers
6
Consider the following page reference string. $1\ 2\ 3\ 4\ 2\ 1\ 5\ 6\ 2\ 1\ 2\ 3\ 7\ 6\ 3\ 2\ 1\ 2\ 3\ 6\ $ What are the minimum number of frames required to get a single page fault for the above sequence assuming LRU replacement strategy? $7$ $4$ $6$ $5$
asked Jan 13 in Operating System Satbir 1k views
0 votes
0 answers
7
Write a program that will demonstrate the difference between using a local page replacement policy and a global one for the simple case of two processes. You will need a routine that can generate a page reference string based on a statistical model. This model has $N$ ... a global policy instead of a local one. Also, contrast the per-process page fault rate with that of the local policy approach.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 51 views
1 vote
1 answer
9
Consider the following two-dimensional array: int X[64][64]; Suppose that a system has four page frames and each frame is $128$ words (an integer occupies one word). Programs that manipulate the $X$ array fit into exactly one page and always occupy page $0.$ The data are swapped in and out of the other three frames ... B for (int i = 0; i < 64; i++) for (int j = 0; j < 64; j++) X[i][j] = 0;
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 87 views
0 votes
0 answers
10
Suppose that two processes $A$ and $B$ share a page that is not in memory. If process $A$ faults on the shared page, the page table entry for process $A$ must be updated once the page is read into memory. Under what conditions should the page table update ... of process $A's$ page fault will bring the shared page into memory? Explain. What is the potential cost of delaying the page table update?
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 70 views
0 votes
1 answer
11
A computer has four page frames. The time of loading, time of last access, and the $R$ and $M$ bits for each page are as shown below (the times are in clock ticks): Which page will NRU replace? Which page will FIFO replace? Which page will LRU replace? Which page will second chance replace?
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 388 views
1 vote
0 answers
12
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 45 views
0 votes
0 answers
13
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.’’ What is that attribute for the FIFO algorithm? LRU algorithm? Optimal algorithm? Give the generic algorithm for these page replacement algorithms.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 78 views
0 votes
0 answers
14
Suppose that the $\text{WSClock}$ page replacement algorithm uses a $\tau$ of two ticks, and the system state is the following: where the three flag bits $V, R,$ and $M$ ... to a read request to page $4.$ Show the contents of the new table entries. Explain. (You can omit entries that are unchanged.)
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 192 views
0 votes
0 answers
16
Give a simple example of a page reference sequence where the first page selected for replacement will be different for the clock and $LRU$ page replacement algorithms. Assume that a process is allocated $3=\text{three}$ frames, and the reference string contains page numbers from the set $0, 1, 2, 3.$
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 55 views
0 votes
0 answers
17
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, the values are $1011, 1010, 1101, 0010, 1010, 1100,$ and $0001.$ If the aging algorithm is used with an $8-bit$ counter, give the values of the four counters after the last tick.
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 124 views
0 votes
0 answers
18
0 votes
0 answers
19
0 votes
0 answers
20
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 79 views
0 votes
0 answers
21
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?
asked Oct 26, 2019 in Operating System Lakshman Patel RJIT 32 views
1 vote
4 answers
22
Consider that a process has been allocated $3$ frames and has a sequence of page referencing as $1, 2, 1, 3, 7, 4, 5, 6, 3, 1$. What shall be the difference in page faults for the above string using the algorithms of LRU and optimal page replacement for referencing the string? $2$ $0$ $1$ $3$
asked Jul 2, 2019 in Operating System Arjun 645 views
0 votes
0 answers
24
Can anyone explain me the working of NRU & SECOND CHANCE REPLACEMENT ALGORITHM.
asked Jan 15, 2019 in Operating System Jyoti Kumari97 43 views
0 votes
0 answers
25
Assume there are 5 frames and consider the following reference string find the number of page faults using NRU page replacement algorithm. 3,2,3, 0,8,4,2,5,0,9,8,3,2
asked Jan 15, 2019 in Operating System Jyoti Kumari97 132 views
0 votes
1 answer
26
What is the reason for Belady’s Anomaly,I am aware that it is not a stack based algorithm and for a certain set of pages it shows this anomaly where the increase in page frame increases the page fault rate.
asked Dec 28, 2018 in Operating System sripo 270 views
0 votes
0 answers
27
Do we need to cover page replacement implementations for gate? Please suggest
asked Dec 24, 2018 in Operating System Mayankprakash 88 views
1 vote
2 answers
28
0 votes
0 answers
30
State True/False:- A Page replacement algorithm suffers from Belody's anomoly when it is not a stack algorithm. how to identify a stack algorithm? Is LRU stack algorithm? Is FIFO stack algorithm?
asked Oct 1, 2018 in Operating System Naveen Kumar 3 79 views
...