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.