Computer Science - Operating Systems Concepts - Discussion
Discussion Forum : Operating Systems Concepts - Section 1 (Q.No. 10)
10.
The LRU algorithm
Discussion:
5 comments Page 1 of 1.
Sharon said:
1 decade ago
Discards the least recently used items first. This algorithm requires keeping track of what was used when, which is expensive if one wants to make sure the algorithm always discards the least recently used item. General implementations of this technique require keeping "age bits" for cache-lines and track the "Least Recently Used" cache-line based on age-bits.
In such an implementation, every time a cache-line is used, the age of all other cache-lines changes. LRU is actually a family of caching algorithms with members including: 2Q by Theodore Johnson and Dennis Shasha and LRU/K by Pat O'Neil, Betty O'Neil and Gerhard Weikum.
In such an implementation, every time a cache-line is used, the age of all other cache-lines changes. LRU is actually a family of caching algorithms with members including: 2Q by Theodore Johnson and Dennis Shasha and LRU/K by Pat O'Neil, Betty O'Neil and Gerhard Weikum.
Sujeet kumar nangloi , delhi said:
1 decade ago
LRU is the algorithm of page replacement that is very least used for long period.
SIPRA said:
1 decade ago
LRU(Least Recently Used) is a page replacement algorithm.The criteria of this algorithm "Replace a page that has not been used for the longest period".
Jivendra said:
1 decade ago
LRU is used to page replacement last recently used.
Hotestonnet said:
1 decade ago
LRU (Least Recently Used)
Post your comments here:
Quick links
Quantitative Aptitude
Verbal (English)
Reasoning
Programming
Interview
Placement Papers