Abstract: 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.
Index Terms:
distributed databases; sorting; database theory; merging; parallel algorithms; software performance evaluation; hypercube networks; parallel database systems; sorting; hypercube-based systems; disk based sorting; parallel merge sort; bitonic sort algorithms; performance; benchmark; database operations
Citation:
E. Schikuta, P. Kirkovits, "Analysis and Evaluation of Sorting on Hypercube-Based Systems," pdp, pp.0258, 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996