Markov Analysis of Multiple-Disk Prefetching Strategies for External Merging

Abstract Multiple-disk organizations can be used to improve the I/O performance of problems like external merging. Concurrency can be introduced by overlapping I/O requests at different disks and by prefetching additional blocks on each I/O operation. To support this prefetching, a memory cache is required. Markov models for two prefetching strategies are developed and analyzed. Closed-form expressions for the average parallelism obtainable for a given cache size and number of disks are derived for both prefetching strategies. These analytic results are confirmed by simulation.

[1]  Michael K. Molloy.  Fundamentals of Performance Modeling , 1990, SIGMETRICS Perform. Evaluation Rev..

[2]  A. L. Narasimha Reddy,et al.  An Evaluation of Multiple-Disk I/O Systems , 1989, IEEE Trans. Computers.

[3]  Thomas H. Cormen.  Fast Permuting on Disk Arrays , 1993, J. Parallel Distributed Comput..

[4]  Jeffrey Scott Vitter,et al.  Optimal disk I/O with parallel block transfer , 1990, STOC '90.

[5]  Alok Aggarwal,et al.  The input/output complexity of sorting and related problems , 1988, CACM.

[6]  Jeffrey Scott Vitter,et al.  Large-Scale Sorting in Uniform Memory Hierarchies , 1993, J. Parallel Distributed Comput..

[7]  H. T. Kung,et al.  I/O complexity: The red-blue pebble game , 1981, STOC '81.

[8]  Carla Schlatter Ellis,et al.  Prefetching in File Systems for MIMD Multiprocessors , 1990, IEEE Trans. Parallel Distributed Syst..

[9]  Emil Grosswald,et al.  The Theory of Partitions , 1984 .

[10]  Jean-Loup Baer,et al.  The I/O Performance of Multiway Mergesort and Tag Sort , 1985, IEEE Transactions on Computers.

[11]  Michelle Y. Kim,et al.  Synchronized Disk Interleaving , 1986, IEEE Transactions on Computers.

[12]  Miron Livny,et al.  Multi-disk management algorithms , 1987, SIGMETRICS '87.

[13]  Garth A. Gibson.  Performance and Reliability in Redundant Arrays of Inexpensive Disks , 1999, Int. CMG Conference.

[14]  Prithviraj Banerjee,et al.  Design, Analysis, and Simulation of I/O Architectures for Hypercube , 1990, IEEE Trans. Parallel Distributed Syst..

[15]  Vinay S. Pai,et al.  Prefetching with multiple disks for external mergesort: simulation and analysis , 1992, [1992] Eighth International Conference on Data Engineering.

[16]  H KatzRandy,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988 .

[17]  Randy H. Katz,et al.  A case for redundant arrays of inexpensive disks (RAID) , 1988, SIGMOD '88.

[18]  Hector Garcia-Molina,et al.  Disk striping , 1986, 1986 IEEE Second International Conference on Data Engineering.

[19]  H. V. Jagadish,et al.  Direct transitive closure algorithms: design and performance evaluation , 1990, TODS.

[20]  Per-Åke Larson,et al.  Speeding up External Mergesort , 1996, IEEE Trans. Knowl. Data Eng..