replacement algorithm

The method used to determine which entry in an associative cache to flush to main memory when it is desired to cache a new block of data. The "least recently used" algorithm flushed the block which has not been accessed for the longest time. A random replacement algorithm picks any block with equal probability.

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

Mentioned in

cache
demand paging
Memory Management Unit

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.