cache replacement policies 缓存置换机制
cache algorithms (also frequently called cache replacement algorithms or cache replacement policies)
常见方法有：
- 先进先出算法（FIFO）：最先进入的内容作为替换对象
- 最近最少使用算法（LFU）：最近最少使用的内容作为替换对象
- 最久未使用算法（LRU）：最久没有访问的内容作为替换对象
- 非最近使用算法（NMRU）：在最近没有使用的内容中随机选择一个作为替换对象
- Belady's Min
各种算法
- Bélády's algorithm
- First in first out (FIFO)
- Last in first out (LIFO)
- Least recently used (LRU)
- Time aware least recently used (TLRU)
- Most recently used (MRU)
- Pseudo-LRU (PLRU)
- Random replacement (RR)
- Segmented LRU (SLRU)
- Least-frequently used (LFU)
- Least frequent recently used (LFRU)
- LFU with dynamic aging (LFUDA)
- Low inter-reference recency set (LIRS)
- Adaptive replacement cache (ARC)
- Clock with adaptive replacement (CAR)
- Multi queue (MQ)
- Pannier: Container-based caching algorithm for compound objects