By Topic

A fast parallel sorting algorithm on the k-dimensional reconfigurable mesh

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)
Ju-Wook Jang ; Dept. of Electron. Eng., Sogang Univ., Seoul, South Korea ; Kichul Kim

We presents a new parallel sorting algorithm on the k-dimensional reconfigurable mesh which is a generalized version of the well-studied (two dimensional) reconfigurable mesh. We introduce a new mapping technique which combines the enlarged bandwidth of the multidimensional mesh and the feature of the reconfigurable mesh. Using our mapping technique, we show that Nk numbers can be sorted in O(4k ) (constant time for small k) time on a k+1 dimensional reconfigurable mesh of size k+1 times N×N×…×N. In addition, it is shown that the number of 1's in a 0/1 array of k times size N×N×…×N can be computed in O(log* N+log k) time on reconfigurable k times mesh of size N×N×…×N

Published in:

Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on

Date of Conference:

10-12 Dec 1997