586 views
0 votes
0 votes
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?

1 Answer

0 votes
0 votes
No need for replacement initially as they are already empty. we see replacement when the memory is full. And the second one i think both are of same cost in implementation. just a guess.

Related questions

3 votes
3 votes
1 answer
1
Sona Barman asked Jan 18, 2018
457 views
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.
1 votes
1 votes
0 answers
2
0 votes
0 votes
1 answer
3