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.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">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 ]