Register

Recent questions tagged least-recently-used

132
views
0 answers
1 votes
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 the primary memory ... a) 9 and 7(b) 7 and 9(c) 10 and 12(d) 6 and 7
User Avatar
11.4k
views
4 answers
23 votes
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] ... number of page faults generated during the execution of this code snippet is _______________.
User Avatar
582
views
1 answers
2 votes
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 \; 0 \; 3 \; 4 \; 2 \; 3 \; 0 \; 3 \; 2 \; 1 \; 2 \; 0 \; 1$
User Avatar
327
views
0 answers
0 votes
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 ... Assume an LRUpolicy for block replacement. Show the state of cache at the end.
User Avatar
1.0k
views
2 answers
0 votes
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 ... earlier than page $2$.(LRU algorithm is used).$3$5$4$None of these.
User Avatar
376
views
0 answers
1 votes
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. ... reference string contains page numbers from the set $0, 1, 2, 3.$
User Avatar
4.6k
views
4 answers
1 votes
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 ... $0$1$3$
User Avatar
401
views
0 answers
0 votes
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 memory ... like. 1.tag(7)set(1)offset(4) 2.tag(7)set(1)offset(2)
User Avatar
174
views
0 answers
0 votes
Self doubt
Can anyone explain me the working of NRU & SECOND CHANCE REPLACEMENT ALGORITHM.
User Avatar
448
views
0 answers
0 votes
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 size ... set associative cache?(A)11 (B) 19 (C) 35 (D) None of these
User Avatar
507
views
1 answers
3 votes
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
997
views
0 answers
6 votes
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 ... it be:page-fault-rate(OPT($S$)) = page-fault-rate(LRU($S^R$))???
User Avatar
409
views
0 answers
1 votes
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][i] ... ++) for (int j = 0; j < 100; j++) A[i][j] = A[i][j] + A[j][i];
User Avatar
421
views
1 answers
0 votes
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 ... ?Please refer : https://www.cs.uic.edu/~jbell/CourseNotes/OperatingSystems/9_VirtualMemory.html
User Avatar
331
views
0 answers
0 votes
set associative cache
User Avatar
769
views
1 answers
0 votes
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 implementation?
User Avatar
2.2k
views
6 answers
0 votes
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 faults occur with the reference ... $ $12$10$ $9$
User Avatar
563
views
1 answers
2 votes
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 ... following memory block will not be in cache if LRU replacement policy is used?159812948
User Avatar
539
views
2 answers
1 votes
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 ... 1 having been brought earlier than page 2 and LRU being the replacement strategy used.
User Avatar
657
views
1 answers
0 votes
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 implement? Why?
User Avatar
3.5k
views
3 answers
9 votes
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, ... page replacement is done?What are the types of misses occured in this case?
User Avatar
To see more, click for the full list of questions or popular tags.