This Article 
 Bibliographic References 
 Add to: 
Multiple Prefetch Adaptive Disk Caching
February 1993 (vol. 5 no. 1)
pp. 88-103

A new disk caching algorithm is presented that uses an adaptive prefetching scheme to reduce the average service time for disk references. Unlike schemes which simply prefetch the next sector or group of sectors, this method maintains information about the order of past disk accesses which is used to accurately predict future access sequences. The range of parameters of this scheme is explored, and its performance is evaluated through trace-driven simulation, using traces obtained from three different UNIX minicomputers. Unlike disk trace data previously described in the literature, the traces used include time stamps for each reference. With this timing information-essential for evaluating any prefetching scheme-it is shown that a cache with the adaptive prefetching mechanism can reduce the average time to service a disk request by a factor of up to three, relative to an identical disk cache without prefetching.

[1] M. J. Bach,Design of the UNIX Operating System. Englewood Cliffs, NJ: Prentice-Hall, 1986.
[2] J.-L. Baer, "Dynamic improvement of locality in virtual memory systems,"IEEE Trans. Software Eng., vol. SE-2, Mar. 1976.
[3] J. P. Buzen, "BEST/1 analysis of the IBM 3880-13 cached storage controller," inProc. CMG 13th Int. Conf., San Diego, CA, Dec. 1982.
[4] Cray X-MP and Cray-1 Computer Systems: IOS Software Internal Reference Manual, Cray Research, Inc., Mendota Heights, MI, 1984.
[5] K. S. Grimsrud, "Multiple prefetch adaptive disk caching with strategic data layout," M.S. thesis, Brigham Young University, Dec. 1989.
[6] R. R. Henry, "VAX address and instruction traces: A description of the tracer utility" Univ. California, Berkeley, 1983.
[7] W. Hugelshofer, "Cache buffer for disk accelerates minicomputer performance,"Electron., Feb. 10, 1982.
[8] M. McKusick, W. Joy, S. Leffler, and R. Fabry, "A fast file system for UNIX,"ACM Trans. Comput. Syst., vol. 2, no. 3, pp. 181-197, Aug. 1984.
[9] M. N. Nelson, B. B. Welch, and J. K. Ousterhout, "Caching in the Sprite network file system,"ACM Trans. Comput. Syst.vol. 6, no. 1, Feb. 1988.
[10] J. Ousterhoutet al., "Trace-driven analysis of the Unix 4.2 BSD file system," inProc. 10th ACM Symp. on Operating System Principles, Dec. 1985.
[11] A. J. Smith, "Sequential program prefetching in memory hierarchies,"IEEE Comput., vol. 11, Dec. 1978.
[12] A. J. Smith, "Sequentiality and prefetching in database systems,"ACM Trans. Database Syst., vol. 3, no. 3, pp. 223-247, Sept. 1978.
[13] A. Smith, "Cache Memories,"Computing Surveys, Vol. 14, No. 3, Sept. 1982, pp. 473- 530.
[14] A. J. Smith, "Disk cache-miss ratio analysis and design considerations,"ACM Trans. Comput. Syst., vol. 3, no. 3, pp. 161-203, Aug. 1985.

Index Terms:
disk caching algorithm; adaptive prefetching scheme; average service time; trace-driven simulation; UNIX minicomputers; cache; buffer storage; magnetic disc storage; storage management
K.S. Grimsrud, J.K. Archibald, B.E. Nelson, "Multiple Prefetch Adaptive Disk Caching," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 1, pp. 88-103, Feb. 1993, doi:10.1109/69.204094
Usage of this product signifies your acceptance of the Terms of Use.