DocumentCode :
3591739
Title :
Performance Analysis of Parallel Sorting Algorithms Using MPI
Author :
Durad, Muhammad Hanif ; Akhtar, Muhammad Naveed ; Irfan-ul-Haq
fYear :
2014
Firstpage :
202
Lastpage :
207
Abstract :
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.
Keywords :
message passing; parallel algorithms; sorting; MPI; architectures; data processing; parallel sorting algorithms; unified performance analysis; Algorithm design and analysis; Clustering algorithms; Hypercubes; Market research; Performance analysis; Sorting; binary sort; bitonic sort; hyper quick sort; merge sort; odd even sort; parallel sorting; radix sort; regular sampling quick sort; shell sort;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Frontiers of Information Technology (FIT), 2014 12th International Conference on
Print_ISBN :
978-1-4799-7504-4
Type :
conf
DOI :
10.1109/FIT.2014.46
Filename :
7118400
Link To Document :
بازگشت