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.

In addition suitable contents:
[ = ] [ ai ] [ al ] [ algorithm ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ b ] [ ba ] [ be ] [ bi ] [ block ] [ ca ] [ cache ] [ cc ] [ ch ] [ ci ] [ ck ] [ data ] [ de ] [ do ] [ du ] [ ec ] [ ed ] [ ee ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ flush ] [ fo ] [ for ] [ ge ] [ h ] [ hm ] [ hr ] [ id ] [ il ] [ in ] [ ir ] [ is ] [ it ] [ la ] [ least recently used ] [ Lex ] [ li ] [ lu ] [ ly ] [ ma ] [ main memory ] [ memory ] [ method ] [ mo ] [ mod ] [ module ] [ na ] [ ne ] [ ng ] [ no ] [ om ] [ ph ] [ pl ] [ pr ] [ query ] [ random ] [ rc ] [ re ] [ ro ] [ se ] [ sh ] [ si ] [ so ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ ua ] [ us ] [ ve ]