Cache replacement policy
Cache in the computer world is very useful. In the calculation, caching algorithm (also often called a cache replacement algorithm, or cache replacement policy) is an optimization algorithm or instructions, the computer program or hardware maintenance structure for information may be stored on a computer to manage cache utilization. Caching can increase maintained at a faster or cheaper than the normal term calculation data memory storage location access memory or recently often used by the performance. When the cache is full, the algorithm must be selected to make room for new people to discard the project. This had to introduce some principles and several cache replacement strategy.
Introduction
Tactics
- Bélády algorithm
- First In First Out (FIFO)
- Last in, first out (LIFO)
- Least Recently Used (LRU)
- TLRU
- Recently Used (MRU)
- Pseudo-LRU（PLRU）
- Random replacement (Random replacement, RR)
- Bundang LRU (Segmented LRU)
- Least frequently used (Least-frequently used, LFU)
- Recently the least frequently used (Least frequent recently used, LFRU)
- Dynamic aging LFU (LFU with dynamic aging, LFUDA)
- Low inter-reference recency set（LIRS）
- Adaptive replacement cache (ARC)
- Clock with adaptive replacement (CAR)
- Many queue (MQ)
- Pannier: Container-based caching algorithm for compound objects
Reference links
