Register

Lru tech(set associativ memory)

1,273 views
0 0 votes
Consider a fully associative cache with 6 cache blocks (0 to 5) and the following sequence of memory block requests:
                                   5, 4, 29, 18, 21, 7, 25, 18, 16, 35, 45, 22, 7, 16
If LRU replacement policy is used, which cache block is used for memory block 16? Assume initially 6 blocks are placed in a cache according to lexicographic order of cache index.

explain in detail...

1 Answer

0 0 votes
16 ll be in Block 1

 

0- 5-25(5 ll be replaced by 25)

1-4-16

2-29-35

3-18-7

4-21-45

5-7-22
Voting & Accepting an answer helps improve the community
← Previous · made easy test serie...Next → · What will be the out...
← Previous in category · made easy test serie...Next in category → · DMA operation
Position:
Show:

Related questions

2 2 votes
2 2 answers
156
156 views
GO Classes asked Aug 12
156 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...
0 0 votes
1 1 answer
559
559 views
Prerna_Study asked Oct 28, 2024
559 views
LRU and FIFO policy
Calculate the number of hits and misses in a 4-blocked cache for the LRU and FIFO policy if the sequence of block reference by CPU is given like: 2,2,3,4,2,5,6,4,7,5.
0 0 votes
1 1 answer
964
964 views
S Ram asked Jan 12, 2019
964 views
Self doubt about LRU and Direct mapping cache
Can we apply LRU policy to direct mapped cache. according to me it doesn't make any sense as eventually it will be like FIFO only as unique memory addresses are assigned ...
3 3 votes
1 answers 1 answer
6.2k
6.2k views
Amit puri asked Jul 30, 2017
6,210 views
lru associatve
A byte addressable computer has a small data cache capable of holding eight 32 bit words. Each cache block consists of two 32 bit words. For the following sequence of add...