By Topic

An adaptive block management scheme using on-line detection of block reference patterns

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jongmoo Choi ; Dept. of Comput. Eng., Seoul Nat. Univ., South Korea ; Noh, S.H. ; Sang Lyul Min ; Yookun Cho

Recent research has shown that near-optimal performance can be achieved by adaptive block replacement policies that use user-level hints regarding the block reference pattern. However, obtaining user-level hints requires considerable effort from users, making it difficult to apply adaptive replacement policies to diverse kinds of applications. We propose a new adaptive block management scheme that we call DEAR (DEtection-based Adaptive Replacement) which makes online detections of block reference patterns of applications using decision trees without user intervention. Based on the detected reference pattern, DEAR applies an appropriate replacement policy to each application. This scheme is suitable for buffer management in systems such as multimedia servers where data reference patterns of applications may be diverse. Results from trace-driven simulations show that the DEAR scheme can detect the reference patterns of applications and reduce the miss ratio by up to 15% compared to the LRU (least recently used) policy

Published in:

Multi-Media Database Management Systems, 1998. Proceedings. International Workshop on

Date of Conference:

5-7 Aug 1998