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.