Experimental analysis of a mixed-mode parallel architecture using bitonic sequence sorting
Journal of Parallel and Distributed Computing
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Parallel and distributed computing handbook
Parallel and distributed computing handbook
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A new deterministic parallel sorting algorithm with an experimental evaluation
Journal of Experimental Algorithmics (JEA)
Minimizing Communication in the Bitonic Sort
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Physically-based visual simulation on graphics hardware
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware
Parallel FFT on ATM-based networks of workstations
Cluster Computing
The universality of various types of SIMD machine interconnection networks
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
A new approximation algorithm for sorting of signed permutations
Journal of Computer Science and Technology
Efficient Communication in Metacube: A New Interconnection Network
ISPAN '02 Proceedings of the 2002 International Symposium on Parallel Architectures, Algorithms and Networks
Linear algebra operators for GPU implementation of numerical algorithms
ACM SIGGRAPH 2003 Papers
The potential of the cell processor for scientific computing
Proceedings of the 3rd conference on Computing frontiers
High-Performance Embedded Computing: Architectures, Applications, and Methodologies
High-Performance Embedded Computing: Architectures, Applications, and Methodologies
Bitonic Sort on a Mesh-Connected Parallel Computer
IEEE Transactions on Computers
CellSort: high performance sorting on the cell processor
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Computers and Electrical Engineering
The Design of Co-processor for the Image Processing Single Chip System
ICCIT '09 Proceedings of the 2009 Fourth International Conference on Computer Sciences and Convergence Information Technology
Parallel Programming: for Multicore and Cluster Systems
Parallel Programming: for Multicore and Cluster Systems
The Journal of Supercomputing
Fast in-place sorting with CUDA based on bitonic sort
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
Automated tuning in parallel sorting on multi-core architectures
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Parallel Sorting on Recursive Dual-Nets
PDCAT '10 Proceedings of the 2010 International Conference on Parallel and Distributed Computing, Applications and Technologies
Sorting unsigned permutations by weighted reversals, transpositions, and transreversals
Journal of Computer Science and Technology
Bitonic sort in shared SIMD array processor
Proceedings of the 2011 International Conference on Communication, Computing & Security
Fast in-place, comparison-based sorting with CUDA: a study with bitonic sort
Concurrency and Computation: Practice & Experience
Analysis of Multi-Sort Algorithm on Multi-Mesh of Trees (MMT) architecture
The Journal of Supercomputing
Bitonic Sorting on Dynamically Reconfigurable Architectures
IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Designing Sorting Networks: A New Paradigm
Designing Sorting Networks: A New Paradigm
The Optical Chained-Cubic Tree interconnection network: Topological structure and properties
Computers and Electrical Engineering
An Implementation of Sorting Algorithm Based on Java Multi-thread Technology
ICCSEE '12 Proceedings of the 2012 International Conference on Computer Science and Electronics Engineering - Volume 01
Sorting on GPUs for large scale datasets: A thorough comparison
Information Processing and Management: an International Journal
Energy cost evaluation of parallel algorithms for multiprocessor systems
Cluster Computing
| Hi-index | 0.00 |
Bitonic sort is one of the fastest oblivious parallel sorting algorithms known so far. Due to its high modularity, bitonic sort can be mapped to different interconnection networks. In this paper, the bitonic sort algorithm is mapped to the chained-cubic tree (CCT) interconnection network. It is shown that the computation time of the bitonic sort on a CCT (BSCCT) algorithm is O((n/p)xlog(np)) and that the communication cost is O(plog^2p), assuming that n keys are evenly distributed among p processors that comprise a given CCT network. Simulation is implemented and used to assess the performance of the BSCCT algorithm in terms of computation time, communication cost, message delay, and key comparisons. Simulation results showed that the BSCCT algorithm achieves a speedup that is almost 12-fold relative to a bitonic sort on a single processor, when 1024 processors were used to sort 32M keys.