An accurate and practical buffer allocation model for the buffer cache based on marginal gains

Authors:
Jong Min Kim;Donghee Lee;Sam H. Noh;Sang Lyul Min;Yookun Cho;Chong Sang Kim
Affiliations:
School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea;Department of Computer Science and Statistics, University of Seoul, Seoul, Republic of Korea;School of Information and Computer Engineering, Hong-Ik University, Seoul, Republic of Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Republic of Korea
Venue:
Information Processing Letters
Year:
2003

Citing 8
Cited 0

The design of the UNIX operating system

The design of the UNIX operating system
Informed prefetching and caching

SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
Adaptive page replacement based on memory reference behavior

SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
EELRU: simple and effective adaptive page replacement

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Towards application/file-level characterization of block references: a case for fine-grained buffer management

Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Program Behavior: Models and Measurements

Program Behavior: Models and Measurements
Operating Systems Theory

Operating Systems Theory
A low-overhead high-performance unified buffer management scheme that exploits sequential and looping references

OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4

Quantified Score

Hi-index	0.89

Visualization

Abstract

A new dynamic buffer allocation strategy based on the notion of marginal gains is presented for the buffer cache that is used by the operating system to store frequently accessed disk blocks in main memory, and the performance of the proposed strategy is compared with those of previous allocation strategies. In the proposed strategy, marginal gain values are predicted by exploiting functions that approximate the expected number of buffer hits per unit time. Experimental results from both trace-driven simulation and an actual implementation in the FreeBSD operating system show that the proposed strategy accurately predicts the marginal gain values for various workloads resulting in significantly improved buffer hit ratios.