Prefetching Policy based on File Acess Pattern and Cache Area


The KIPS Transactions:PartA, Vol. 8, No. 4, pp. 447-454, Dec. 2001
10.3745/KIPSTA.2001.8.4.447,   PDF Download:

Abstract

Various caching and prefetching algorithms have been investigated to identify an effective method for improving the performance of I/O devices. A prefetching algorithm decreases the processing time of a system by reducing the number of disk accesses when an I/O is needed. This paper proposes an AMBA prefetching method that is an extended version of the OBA prefetching method. The AMBA prefetching method will prefetch blocks continuously as long as disk bandwidth is enough. In this method, though there were excessive data request rate, we would expect efficient prefetching. And in the AMBA prefetching method, to prevent the cache pollution, it limits the number of data blocks to be prefetched within the cache area. It can be implemented in a user-level File System based on a Linux Operating System. In particular, the proposed prefetching policy improves the system performance by about 30~40% for large files that are accessed sequentially.


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]
J. D. Lim, J. H. Hwangbo, K. S. Koh, D. W. Seo, "Prefetching Policy based on File Acess Pattern and Cache Area," The KIPS Transactions:PartA, vol. 8, no. 4, pp. 447-454, 2001. DOI: 10.3745/KIPSTA.2001.8.4.447.

[ACM Style]
Jae Deok Lim, Jun Hyoung Hwangbo, Kwang Sik Koh, and Dae Wha Seo. 2001. Prefetching Policy based on File Acess Pattern and Cache Area. The KIPS Transactions:PartA, 8, 4, (2001), 447-454. DOI: 10.3745/KIPSTA.2001.8.4.447.