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.