Cart (Loading....) | Create Account
Close category search window
 

An Improved Parallel Sorting Algorithm for Odd Sequence

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)
Xie Hongwei ; Taiyuan Univ. of Technol., Taiyuan, China ; Xue Yafeng

This paper studies the bitonic merge sort algorithm which is difficult to get the prospective sorted result for some odd sequence. We develop a new parallel sorting algorithm, increasing CCI (compare and conditionally interchange) operations, derived from the odd merge sort algorithm. The proposed algorithm is based on a divide-and-conquer strategy. First of all, the sequence to be sorted is decomposed in several groups that are sorted in parallel. After that, all groups are merged into a final, sorted sequence. Therefore, any odd bitonic sequence can be correctly sorted with the mended algorithm. Furthermore, the paper analyzes the computational complexity of the new algorithm and compares it with that of other well-known parallel sorting algorithms. It does not increase memory consumption, and keep the same complexity. Analytic results are compared with those of the sequential algorithm and parallel implementations of other sorting algorithms, obtaining that our proposal outperforms the other solutions.

Published in:

Advanced Computer Theory and Engineering, 2008. ICACTE '08. International Conference on

Date of Conference:

20-22 Dec. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.