Register

Recent questions tagged least-recently-used

2 2 votes
2 2 answers
113
113 views
GO Classes DPP | GATE CS | Operating System | LRU vs Clock
A demand-paging system has $4$ physical frames $P1,P2,P3,P4$.The page-reference sequence is:$A,\ B,\ C,\ D,\ E,\ B,\ A,\ D,\ B,\ C$Initially, all frames are empty.Two rep...
User Avatar
2 2 votes
2 2 answers
131
131 views
GO Classes DPP | GATE CS | Operating System | LRU Page Replacement
A virtual-memory system uses the LRU page-replacement algorithm.There are four physical page frames at hexadecimal addresses:$4000,\ 5000,\ 6000,\ 7000$The page-reference...
User Avatar
2 2 votes
2 2 answers
131
131 views
GO Classes DPP | GATE CS | Operating System | Virtual Memory and LRU
Which of the following statements about virtual memory is correct?The LRU algorithm selects for replacement the page for which the longest time has elapsed since its last...
User Avatar
0 0 votes
1 1 answer
487
487 views
Topic - Page Replacement algorithm
Consider the following page address trace generated by a cache main memory scheme and has a cache capacity of four pages:1,6, 4,5, 1, 4, 3, 2, 1, 2, 1, 4, 6, 7, 4Assuming...
User Avatar
1 1 vote
0 0 answers
545
545 views
Page replacement policy
For a certain page trace starting with no page in the memory, a demand-paged memory system operated under the LRU replacement policy results in 9 and 11 page faults when ...
User Avatar
80 80 votes
11 answers 11 answers
31.0k
31.0k views
GATE CSE 2023 | Question: 47
Consider the following two-dimensional array $\text{D}$ in the $\text{C}$ programming language, which is stored in row-major order:int D[128][128];Demand paging is used f...
User Avatar
2 2 votes
1 1 answer
968
968 views
DRDO CSE 2022 Paper 2 | Question: 6
Compute the hit rate and miss/fault rate in least recently used page replacement algorithm for the given reference string with $4$ page frames. String: $7 \; 0 \; 1 \; 2 ...
User Avatar
0 0 votes
0 0 answers
656
656 views
William Stallings - Computer Organization and Architecture D
A computer system contains a main memory of 32KB. It also has a 4KB cache divided into four-lines/set with 64B per line. Assume that thecache is initially empty. The proc...
User Avatar
0 0 votes
2 2 answers
1.4k
1.4k views
NIELIT 2016 MAR Scientist B - Section C: 38
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 th...
User Avatar
1 1 vote
0 0 answers
521
521 views
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 31 (Page No. 257)
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. As...
User Avatar
1 1 vote
4 4 answers
6.3k
6.3k views
UGC NET CSE | June 2019 | Part 2 | Question: 43
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 fault...
User Avatar
0 0 votes
0 0 answers
728
728 views
ME TEST
A byte addressable computer has a small data cache capable of holding 16 32-bit words. Each cache block consist of four 32 bits words. For the following sequence of main ...
User Avatar
0 0 votes
0 0 answers
290
290 views
Self doubt
Can anyone explain me the working of NRU & SECOND CHANCE REPLACEMENT ALGORITHM.
User Avatar
0 0 votes
0 0 answers
872
872 views
Gate forum work book
Assume that we have three scenariosl. a fully associative cache,2. a two way set associative cache and3. a direct mapped cache.The cache size is 256 bytes. The cache line...
User Avatar
4 4 votes
1 answers 1 answer
812
812 views
LRU page replacement policy
Self doubt:What is the rule or keyb point we should keep in mind while solving problems on LRU page replacement algorithm? Please explain with examples.
User Avatar
6 6 votes
0 0 answers
1.6k
1.6k views
OS Galvin - Doubt
Strangely, if we let $S^R$ be the reverse of a reference string S, then the page-fault rate for the OPT algorithm on S is the same as the page-fault rate for the OPT algo...
User Avatar
1 1 vote
0 0 answers
604
604 views
Operating Systems Concepts Page fault using LRU
if you have 10 Frames and using LRU how many page fault will be there in both below: for (int j = 0; j < 100; j++) for (int i = 0; i < 100; i++) A[i][j] = A[i][j] + A[j]...
User Avatar
0 0 votes
1 1 answer
642
642 views
LRU replacement
" In the case of LRU, ( and particularly the stack implementation thereof ), the top N pages of the stack will be the same for all frame set sizes of N or anything larger...
User Avatar
0 0 votes
0 0 answers
585
585 views
set associative cache
User Avatar
0 0 votes
1 answers 1 answer
1.3k
1.3k views
ace operating system
Answer given is B, but I think it should be D. Stack will pop the least recently used page from the top. How can having most recently used page on top help in LRU impleme...
User Avatar
0 0 votes
6 6 answers
3.4k
3.4k views
UGC NET CSE | August 2016 | Part 2 | Question: 37
Suppose that the virtual Address space has eight pages and physical memory with four page frames. If $LRU$ page replacement algorithm is used, ______ number of page fault...
User Avatar
2 2 votes
1 answers 1 answer
999
999 views
GATE Overflow | Operating Systems | Test 1 | Question: 25
There is a 4 way set associative cache memory with 8 cache blocks. The main memory consists of 256 blocks and the request for memory blocks is in that order:$$0,255,1,4,3...
User Avatar
1 1 vote
3 3 answers
1.3k
1.3k views
GATE Overflow | Operating Systems | Test 1 | Question: 16
Determine the number of page faults when references to pages occur in the sequence -$1,2,4,5,2,1,2,4$. Assume that the main memory can accommodate 3 pages and already ha...
User Avatar
0 0 votes
1 1 answer
1.2k
1.2k views
LRU policy
In LRU policy for cache replacement. the least recently used block is replaced. So, what happens when all the slots are empty at beginning?Is LRU or MRU easier to impleme...
User Avatar
9 9 votes
3 3 answers
5.6k
5.6k views
page replacement
An 8 byte, 2-way set associative (using LRU replacement) with 2 byte blocks receives requests for the following addresses (represented in binary): 0110, 0000, 0010, 0001,...
User Avatar
To see more, click for the full list of questions or popular tags.