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.