A Buffer Replacement Algorithm utilizing Reference Interval Information


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 4, No. 12, pp. 3175-3184, Dec. 1997
10.3745/KIPSTE.1997.4.12.3175,   PDF Download:

Abstract

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


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. J. Gook and K. G. Yong, "A Buffer Replacement Algorithm utilizing Reference Interval Information," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 4, no. 12, pp. 3175-3184, 1997. DOI: 10.3745/KIPSTE.1997.4.12.3175.

[ACM Style]
Koh Jeong Gook and Kim Gil Yong. 1997. A Buffer Replacement Algorithm utilizing Reference Interval Information. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 4, 12, (1997), 3175-3184. DOI: 10.3745/KIPSTE.1997.4.12.3175.