Analysis and evaluation of sorting on hypercube-based systems

This paper analyzes disk based sorting in parallel database systems. The parallel merge sort and the bitonic sort algorithms are modeled analytically and their performance is estimated. The obtained results are evaluated and compared with benchmark results of an implementation on a hypercube based system. Furthermore a novel, concise, but comprehensive analytical model for the evaluation of parallel database operations is presented.

[1]  Friedhelm Meyer auf der Heide,et al.  The Complexity of Parallel Sorting , 1987, SIAM J. Comput..

[2]  David J. DeWitt,et al.  Parallel algorithms for the execution of relational database operations , 1983, TODS.

[3]  S. Lakshmivarahan,et al.  Parallel Sorting Algorithms , 1984, Adv. Comput..

[4]  Yoshihide Igarashi,et al.  Some Parallel Sorts on a Mesh-Connected Processor Array and Their Time Efficiency , 1986, J. Parallel Distributed Comput..

[5]  H. T. Kung,et al.  Sorting on a mesh-connected parallel computer , 1977, CACM.

[6]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[7]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

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

[9]  David J. DeWitt,et al.  A taxonomy of parallel sorting , 1984, CSUR.

[10]  Erich Schikuta.  Parallel relational database algorithms revisited for range declustered data sets , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[11]  Matthias Jarke,et al.  Query Optimization in Database Systems , 1984, CSUR.

[12]  David J. DeWitt,et al.  Parallel database systems: the future of database processing or a passing fad? , 1990, SGMD.

[13]  David J. DeWitt,et al.  A performance analysis of alternative multi-attribute declustering strategies , 1992, SIGMOD '92.

[14]  David J. DeWitt,et al.  Design considerations for data-flow database machines , 1980, SIGMOD '80.

[15]  Gérard M. Baudet,et al.  Optimal Sorting Algorithms for Parallel Computers , 1978, IEEE Transactions on Computers.