DIG Based Block Replacement Scheme for Efficient Buffer Cache Management

Young Jae Lee, Hyunseung Choo, Seong Moo Yoo

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The effectiveness of the buffer cache replacement is critical to the performance of I/O systems. In this paper, we propose the degree of inter-reference gap (DIG) based block replacement scheme that retains merits of least recently used (LRU) such as simple im¬plementation and good cache hit ratio (CHR) for gen¬eral patterns of references, and improves CHR further. In the proposed scheme, cache blocks with low DIGs are distinguished from blocks with high DIGs and the replacement block is selected among high DIGs blocks as done in the low inter-reference recency set (LIRS) scheme. Thus, by having the effect of least frequently used (LFU) based on DIGs, CHR is improved. Trace-driven simulation is employed to verify the superiority of the DIG based scheme and shows that the perfor-mance improves up to about 65.3% (with an average of 26.6%) compared to the LRU scheme for the same traces.

Original languageEnglish
Title of host publication16th ISCA International Conference on Parallel and Distributed Computing Systems 2003, PDCS 2003
EditorsSeong-Moo Yoo, Hee Yong Youn
PublisherInternational Society for Computers and Their Applications (ISCA)
Pages349-354
Number of pages6
ISBN (Electronic)9781618398161
StatePublished - 2003
Event16th International Conference on Parallel and Distributed Computing Systems, PDCS 2003 - Reno, United States
Duration: 13 Aug 200315 Aug 2003

Publication series

Name16th ISCA International Conference on Parallel and Distributed Computing Systems 2003, PDCS 2003

Conference

Conference16th International Conference on Parallel and Distributed Computing Systems, PDCS 2003
Country/TerritoryUnited States
CityReno
Period13/08/0315/08/03

Fingerprint

Dive into the research topics of 'DIG Based Block Replacement Scheme for Efficient Buffer Cache Management'. Together they form a unique fingerprint.

Cite this