Home Page : Glossary : "L" : LRU
Many caching algorithms use an LRU algorithm, removing from the cache the least recently used item. For example, many database systems use an LRU algorithm when determining which data items to remove from memory so to do many paging algorithms.
The least recently used item is the item in the store which has not been used for the longest. It should not be confused with the oldest (or earliest loaded) item in the store - the oldest item may be the least recently used, but if it was last accessed more recently than another then it would not be the least recently used.
Can you add to this definition? If so please Report an Observation. Do you know of a relevant link to add under this definition? If so please Add a Link.
© Copyright 2004-2008, A B Cryer, All Rights Reserved.