A practical performance comparison of parallel sorting algorithms on homogeneous network of workstations

Authors:
Haroon Rashid;Kalim Qureshi
Affiliations:
COMSATS Institute of Information Technology, Abbottabad, Pakistan;Math. and Computer Science Department, Kuwait University, Kuwait
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 4
Cited 0

A taxonomy of parallel sorting

ACM Computing Surveys (CSUR)
Some parallel sorts on a mesh-connected processor array and their time efficiency

Journal of Parallel and Distributed Computing
The complexity of parallel sorting

SIAM Journal on Computing
System Issues in Parallel Sorting for Database Systems

Proceedings of the Sixth International Conference on Data Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Three parallel sorting algorithms have been implemented and compared in terms of their overall execution time. The algorithms implemented are the odd-even transposition sort, parallel merge sort and parallel rank sort. A homogeneous cluster of workstations has been used to compare the algorithms implemented. The MPI library has been selected to establish the communication and synchronization between the processors. The time complexity for each parallel sorting algorithm will also be mentioned and analyzed.