A Unified Approach to a Class of Data Movements on an Array Processor
IEEE Transactions on Computers
Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
IEEE Transactions on Computers
Parallel algorithms for gray-scale image component labeling on a mesh-connected computer
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On Sorting Multiple Bitonic Sequences
ICPP '94 Proceedings of the 1994 International Conference on Parallel Processing - Volume 01
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
IEEE Transactions on Computers
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
The VLSI Complexity of Sorting
IEEE Transactions on Computers
International Journal of High Performance Computing and Networking
ROE sorting on ILLIAC array processor
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
IBM Journal of Research and Development
Paper: Hybrid systolic sorters
Parallel Computing
Simulating the bitonic sort using P systems
WMC'07 Proceedings of the 8th international conference on Membrane computing
An Architecture for Bitonic Sorting with Optimal VLSI Performnance
IEEE Transactions on Computers
VLSI Sorting with Reduced Hardware
IEEE Transactions on Computers
Bitonic sort in shared SIMD array processor
Proceedings of the 2011 International Conference on Communication, Computing & Security
Data broadcasting in SIMD computers
IEEE Transactions on Computers
It’s elementary, my dear watson: time-optimal sorting algorithms on a completely overlapping network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
| Hi-index | 15.02 |
An O(n) algorithm to sort n2elements on an Illiac IV-like n × n mesh-connected processor array is presented. This algorithm sorts the n2elements into row-major order and is an adaptation of Batcher's bitonic sort. A slight modification of our algorithm yields an O(n) algorithm to sort n2elements into snake-like row-major order. Extensions to the case of a j-dimensi