least recently used

[′lēst ¦rē·sənt·lē ‚yüzed]

(computer science)

A technique for using main storage efficiently, in which new data replace data in storage locations that have not been accessed for the longest period, as determined by an algorithm.

least recently used

(operating systems) (LRU) A rule used in a paging system which selects a page to be paged out if it has been used (read or written) less recently than any other page. The same rule may also be used in a cache to select which cache entry to flush.

This rule is based on temporal locality - the observation that, in general, the page (or cache entry) which has not been accessed for longest is least likely to be accessed in the near future.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Mentioned in

References in periodicals archive

For the recency indicator, the highest value represents the most recently used block, whereas the lowest value (usually 0) represents the least recently used block.

This process created an effect in which the least recently used blocks remained at level 2, and thus, a higher miss ratio was generated at level 2.

Adaptive Neuro-fuzzy Inference System as Cache Memory Replacement Policy

A least recently used (LRU) algorithm is used to decide which buffers to move out of the buffer cache so that new buffers can be read in.

Performance evaluation and tuning in an Oracle DBMS

All content on this website, including dictionary, thesaurus, literature, geography, and other reference data is for informational purposes only. This information should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional.