Buffer Cache Management: Predicting the Future from the Past

Authors:
Affiliations:
Venue:
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Year:
2002

Citing 0
Cited 5

Practically Realizable Efficient Data Allocation and Replication Strategies for Distributed Databases with Buffer Constraints

IEEE Transactions on Parallel and Distributed Systems
Attention-Based information composition for multicontext-aware recommendation in ubiquitous computing

EuroSSC'06 Proceedings of the First European conference on Smart Sensing and Context
Multicontext-Aware recommendation for ubiquitous commerce

ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Compiler-directed file layout optimization for hierarchical storage systems

SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Compiler-directed file layout optimization for hierarchical storage systems

Scientific Programming - Selected Papers from Super Computing 2012

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient and effective management of the buffer cache in the operating system becomes increasingly important as the speed gap between microprocessors and hard disks becomes wider. This paper presents different techniques for predicting the future disk access patterns from the access history of each block and the access patterns detected for related blocks. The first part of the paper focuses on a block replacement policy called LRFU (Least Recently/Frequently Used) that subsumes the well-known LRU (Least Recently Used) and the LFU (Least Frequently Used) policies. Then, the next part discusses techniques for handling regular references such as sequential and looping references. Finally, the results from both trace-driven simulations and our implementation of the techniques within a real operating system are presented.