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.
Original language | English |
---|---|
Pages (from-to) | 93-97 |
Number of pages | 5 |
Journal | Information Processing Letters |
Volume | 85 |
Issue number | 2 |
DOIs | |
State | Published - 31 Jan 2003 |
Keywords
- Buffer allocation
- Buffer cache
- Marginal gain
- Operating systems
- Virtual memory