Open Science Research Excellence
%0 Journal Article
%A Lai Lai Win Kyi and  Nay Min Tun
%D 2011 
%J  International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering
%B World Academy of Science, Engineering and Technology
%I International Science Index 51, 2011
%T Performance Comparison of Parallel Sorting Algorithms on the Cluster of Workstations
%V 51
%X Sorting appears the most attention among all computational tasks over the past years because sorted data is at the heart of many computations. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. Many parallel sorting algorithms have been investigated for a variety of parallel computer architectures. In this paper, 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. Cluster of Workstations or Windows Compute Cluster has been used to compare the algorithms implemented. The C# programming language is used to develop the sorting algorithms. The MPI (Message Passing Interface) library has been selected to establish the communication and synchronization between processors. The time complexity for each parallel sorting algorithm will also be mentioned and analyzed.

%P 447 - 451