Editing Cache replacement policies (section)

{{Short description|Algorithm for caching data}}
{{About|general cache algorithms|detailed algorithms specific to paging|page replacement algorithm|detailed algorithms specific to the cache between a CPU and RAM|CPU cache}}
{{Distinguish|cache placement policies}}
{{Use dmy dates|date=September 2021}}
In [[computing]], '''cache replacement policies''' (also known as '''cache replacement algorithms''' or '''cache algorithms''') are [[Program optimization|optimizing]] instructions or [[algorithm]]s which a [[computer program]] or hardware-maintained structure can utilize to manage a [[cache (computing)|cache]] of information. Caching improves performance by keeping recent or often-used data items in memory locations which are faster, or computationally cheaper to access, than normal memory stores. When the cache is full, the algorithm must choose which items to discard to make room for new data.
__TOC__