Performance Comparison of Parallel Sorting Algorithms on the Cluster of Workstations

Lae Lae Win Kyi Mandalay Technological University, Myanmar Email: laelae83@gmail.com Nay Min Tun Computer University, Myanmar Email: naymin.300777@gmail.com Abstract- 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 shell 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. Keywords- Cluster of Workstations Parallel sorting algorithms performance analysis parallel computing Remark: The full paper may be found in www.inrit2011.com or www.ijcim.th.org.

The First International Conference on Interdisciplinary Research and Development, 31 May - 1 June 2011, Thailand

116.1

Sign up to vote on this title
UsefulNot useful