Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel computing: design and analysis of algorithms
Introduction to parallel computing: design and analysis of algorithms
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
On Self-Similarity and Hamiltonicity of Dual-Cubes
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Efficient Communication in Metacube: A New Interconnection Network
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
The edge-pancyclicity of dual-cube extensive networks
CEA'08 Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications
On embedding cycles into faulty dual-cubes
Information Processing Letters
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Highly Parallelable Bidimensional Median Filter for Modern Parallel Programming Models
Journal of Signal Processing Systems
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Parallel sorting algorithms in hypercubes have been studied extensively. One of the practical parallel sorting algorithms is Bitonic Sort, which is implemented in O (n 2) time for sorting N = 2 n numbers in an n -cube. A versatile family of interconnection networks alternative to hypercube, called metacube, was proposed for building extremely large scale multiprocessor systems with a small number of links per node. A metacube MC(k ,m ) connects $2^{2^km+k}$ nodes with only k + m links per node. In this paper, we present an efficient sorting algorithm on metacube multiprocessors. The proposed sorting algorithm is based on the Batcher's bitonic sorting algorithm. In order to perform the parallel sorting efficiently in metacube, we give a new presentation of the metacube such that the communications required by the algorithm can be done efficiently with gather and scatter operations. The parallel bitonic sort algorithm implemented in metacubes with the new presentation runs in O (2 k m + k )2 computation steps and O (2 k m (2k + 1) + k )2 communication steps.