Loading…
DIG: Degree of inter-reference gap for a dynamic buffer cache management
The effectiveness of the buffer cache replacement is critical to the performance of I/O systems. In this paper, we propose a degree of inter-reference gap (DIG) based block replacement scheme. This scheme keeps the simplicity of the least recently used (LRU) scheme and does not depend on the detecti...
Saved in:
Published in: | Information sciences 2006-04, Vol.176 (8), p.1032-1044 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | The effectiveness of the buffer cache replacement is critical to the performance of I/O systems. In this paper, we propose a
degree of inter-reference gap (DIG) based block replacement scheme. This scheme keeps the simplicity of the
least recently used (LRU) scheme and does not depend on the detection of access regularities. The proposed scheme is based on the
low inter-reference recency set (LIRS) scheme, which is currently known to be very effective. However, the proposed scheme employs several history information items whereas the LIRS scheme uses only one history information item. The overhead of the proposed scheme is almost negligible. To evaluate the performance of the proposed scheme, the comprehensive trace-driven computer simulation is used in general access patterns. Our simulation results show that the
cache hit ratio (CHR) in the proposed scheme is improved as much as 65.3% (with an average of 26.6%) compared to the LRU for the same workloads, and up to 6% compared to the LIRS in multi3 trace. |
---|---|
ISSN: | 0020-0255 1872-6291 |
DOI: | 10.1016/j.ins.2005.01.018 |