By Topic

Algorithms and average time bounds of sorting on a mesh-connected computer

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)
Gu, Q.P. ; Dept. of Electr. & Comput. Eng., Calgary Univ., Alta., Canada ; Jun Gu

We give three new parallel sorting algorithms on a mesh-connected computer with wraparound connections (i.e. a torus). These three algorithms, with the minimum queue size of 1, sort n2 random input data items into a blocked snakelike row major order, a row major order, and a snakelike row major order, in 1.5n+o(n), 2n+o(n), and 2n+o(n) average steps, respectively. These results improve the previous results of 2n+o(n), 2.5n+o(n), and 2.5n+o(n), respectively. In addition, we prove that the distance bound n on a torus is an average-time lower bound independent of indexing schemes of sorting random input data items on it

Published in:

Parallel and Distributed Systems, IEEE Transactions on  (Volume:5 ,  Issue: 3 )