Prefetching with multiple disks for external mergesort: simulation and analysis

The authors present a simulation study of multiple disk systems to improve the input/output (I/O) performance of multiway merging. With the increase in the size of main memory in computer systems, multiple disks and aggressive prefetching can be used to significantly reduce I/O time. Two prefetching strategies-intra-run and inter-run-for external merging using multiple disks were studied. Their performance was evaluated, and simple analytical expressions are derived to explain their asymptotic behavior. The results indicate that a combination of the strategies can result in a significant reduction in I/O time.<<ETX>>

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

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

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

[5]  Richard M. Karp,et al.  Failure correction techniques for large disk arrays , 1989, ASPLOS 1989.

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

[7]  Vinay Sadananda Pai Performance analysis of parallel I/O models for external mergesort , 1991 .

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

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

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

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

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

[13]  Donald E. Knuth,et al.  The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition , 1997 .

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

[15]  Mihalis Yannakakis,et al.  The input/output complexity of transitive closure , 1990, SIGMOD '90.

[16]  D.M. Dias,et al.  System issues in parallel sorting for database systems , 1990, [1990] Proceedings. Sixth International Conference on Data Engineering.

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