2014 12th International Conference on Frontiers of Information Technology (FIT) (2014)
Dec. 17, 2014 to Dec. 19, 2014
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FIT.2014.46
Sorting is one of the classic problems of data processing and many practical applications require implementation of parallel sorting algorithms. Only a few algorithms have been implemented using MPI, in this paper a few additional parallel sorting algorithms have been implemented using MPI. A unified performance analysis of all these algorithms has been presented using two different architectures. On basis of experimental results obtained some guidelines has been suggested for the selection of proper algorithms.
Sorting, Algorithm design and analysis, Clustering algorithms, Market research, Hypercubes, Performance analysis,shell sort, parallel sorting, binary sort, bitonic sort, hyper quick sort, merge sort, odd even sort, regular sampling quick sort, radix sort
Muhammad Hanif Durad, Muhammad Naveed Akhtar, Irfan-ul-Haq, "Performance Analysis of Parallel Sorting Algorithms Using MPI", 2014 12th International Conference on Frontiers of Information Technology (FIT), vol. 00, no. , pp. 202-207, 2014, doi:10.1109/FIT.2014.46