By Topic

A parallel implementation of hybridized merge-quicksort algorithm on MPICH

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Trimananda, R. ; Comput. Eng. Dept., Universitas Pelita Harapan, Lippo Karawaci, Indonesia ; Haryanto, C.Y.

Mergesort and quicksort algorithms are two well-known sorting algorithms that have, in fact, great potential for parallel execution. This paper shows how the two are combined hand-in-hand for sorting large groups of data elements. Hierarchically, data elements are distributed to processors, sorted in smaller groups of data elements in parallel on each processor by using quicksort algorithm, and, later, merged in parallel by using mergesort algorithm. The implementation results on MPICH platform are showing potential speedups provided that the communication channel is adequate for large groups of data elements. Otherwise, longer execution time would be the problem when the data elements have to be transferred between processors. Nevertheless, the hybridized merge-quicksort algorithm is worth of consideration for parallel sorting implementation.

Published in:

Distributed Framework and Applications (DFmA), 2010 International Conference on

Date of Conference:

2-3 Aug. 2010