An implementation study of a detection-based adaptive block replacement scheme

  • Authors:

  • Jongmoo Choi;Sam H. Noh;Sang Lyul Min;Yookun Cho

  • Affiliations:

  • Department of Computer Engineering, Seoul National University, Seoul, Korea;Department of Computer Engineering, Hong-Ik University, Seoul, Korea;Department of Computer Engineering, Seoul National University, Seoul, Korea;Department of Computer Engineering, Seoul National University, Seoul, Korea

  • Venue:
  • ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
  • Year:
  • 1999

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we propose a new adaptive buffer management scheme called DEAR (DEtection based Adaptive Replacement) that automatically detects the block reference patterns of applications and applies different replacement policies to different applications based on the detected reference pattern. The proposed DEAR scheme uses a periodic process. Detection is made by associating block attribute values such as backward distance and frequency gathered at the (i - 1)-th invocation with forward distances of blocks referenced between the (i - 1)-th and i-th invocations. We implemented the DEAR scheme in FreeBSD 2.2.5 and measured its performance using several real applications. The results show that compared with the LRU buffer management scheme, the proposed scheme reduces the number of disk I/Os by up to 51% (with an average of 23%) and the response time by up to 35% (with an average of 12%) in the case of single application executions. For multiple applications, the proposed scheme reduces the number of disk I/Os by up to 20% (with an average of 12%) and the over-all response time by up to 18% (with an average of 8%).