By Topic

Design and performance evaluation of a buffer replacement algorithm utilizing reference interval information

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
$33 $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

2 Author(s)
Jeong-Gook Koh ; Dept. of Comput. Eng., Pusan Nat. Univ., South Korea ; Gil-Yong Kim

To support large storage capacity and fulfill real time characteristics of continuous media storage systems, we need to improve the performance of disk I/O subsystems. To improve the performance, we exploit a data sharing scheme that reduces the number of disk I/Os. We utilize the advance knowledge of continuous media streams that is used to anticipate block demands, and so promoting the sharing of blocks in buffers. We propose a buffer replacement algorithm that enables subsequent users requesting the same data to share data efficiently. The proposed algorithm manages buffers by utilizing reference interval information. In order to verify validity of the proposed algorithm, we accomplish simulation experiments and show the results of performance improvements compared to the traditional buffer replacement algorithms

Published in:

Euromicro Conference, 1998. Proceedings. 24th  (Volume:2 )

Date of Conference:

25-27 Aug 1998