least recently used

(redirected from Cache algorithms)
Also found in: Wikipedia.

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.
References in periodicals archive ?
Cache Algorithms Based on Adaptive Invalidation Reports for Mobile Environments.
It also includes up to 2GB cache per controller, and advanced cache algorithms.
To simplify the protocols, and ensure that one client cannot lose data written by another client, all cooperative cache algorithms, including ours, write dirty blocks back to the server before forwarding them.
New features of the 8600 include new cache algorithms for faster access to data, and cache pre-fetch technology to load data from memory faster.