In
computing, cache algorithms (also frequently called replacement algorithms or replacement policies) are optimizing instructions –
algorithms – that a
computer program or a hardware-maintained structure can follow to manage a
cache of information stored on the computer. Cache size is usually limited, and if the cache is full, the algorithm must choose which items to discard to make room for the new ones.
See more at Wikipedia.org...
(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.
(1995-02-15)
Free Download Now!
