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.