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.