Page replacement and caching policy
14 methods in the atlas attack this one problem. They are rivals: each wins something the others do not.
Phrasings that mean this problem
Page replacementCache admissionOptimal offline pagingCompetitive pagingAccess-model pagingCache replacement policy
computer-architecture
- RRIP replacementRe-reference interval predictionspecialistcomputer-architecture
- Pseudo-LRU replacementTree-bit approximationstandardcomputer-architecture
- Hawkeye replacementBelady-imitating learningspecialistcomputer-architecture
online-competitive
- LRU cachingLeast-recently-used evictioncanonfull lesson ▸online-competitive
- LFU cachingLeast-frequently-used evictionstandardonline-competitive
- FIFO pagingstandalonestandardonline-competitive
- Clock replacementSecond-chance reference bitsstandardonline-competitive
- ARC cachingAdaptive recency-frequency balancestandardonline-competitive
- 2Q cachingTwo-queue admissionspecialistonline-competitive
- LIRS cachingInter-reference recencyspecialistonline-competitive
- TinyLFU admissionFrequency-sketch gatespecialistonline-competitive
- Belady's algorithmFarthest-future evictionstandardonline-competitive
- Marking algorithmPhase-based random evictionspecialistonline-competitive
- Paging with localityWorking-set modelspecialistonline-competitive