Parallel out-of-core sorting and fast accesses to disks
International Journal of High Performance Computing and Networking
Performance analysis of a parallel sort merge join on cluster architectures
ICA3PP'05 Proceedings of the 6th international conference on Algorithms and Architectures for Parallel Processing
Hi-index | 0.00 |
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.