LIRS: An efficient low inter-reference recency set replacement policy to improve buffer cache performance

Performance Evaluation Review

Volumn 30, Issue 1, 2002, Pages 31-42

  Jiang, Song ^a   Zhang, Xiaodong ^a  

^a The College of William and Mary   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DATA STRUCTURES; DATABASE SYSTEMS; PROBABILITY; RESPONSE TIME (COMPUTER SYSTEMS);

BUFFER CACHE MANAGEMENT; LEAST RECENTLY USED; LOW INTERFERENCE RECENCY SET;

CACHE MEMORY;

EID: 0036041807     PISSN: 01635999     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/511399.511340     Document Type: Conference Paper

References (19)

1. An anomaly in space-time characteristics of certain programs running in a paging machine
2. Application-controlled file caching policies
3. Towards application/file-level characterization of block references: A case for fine-grained buffer management
4. An implementation study of a detection-based adaptive block replacement scheme
5. The working set model for program behavior
6. Virtual memory
7. Principles of database buffer management
8. Adaptive page replacement based on memory reference behavior
9. 2Q: A low overhead high performance buffer management replacement algorithm
10. A low-overhead, high-performance unified buffer management scheme that exploits sequential and looping references
11. On the existence of a spectrum of policies that subsumes the least recently used (LRU) and least frequently used (LFU) policies
12. Automatic compiler-inserted I/O prefetching for out-of-core application
13. The LRU-K page replacement algorithm for database disk buffering
14. An inter-reference gap model for temporal locality in program behavior
15. Informed prefetching and caching
16. Data cache management using frequency-based replacement
17. EELRU: Simple and effective adaptive page replacement
18. Distance string models for program behavior