Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
Polymorphic-Torus Architecture for Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Connection autonomy in SIMD computers: a VLSI implementation
Journal of Parallel and Distributed Computing
Constant time sorting on a processor array with a reconfigurable bus system
Information Processing Letters
Meshes with reconfigurable buses
Proceedings of the fifth MIT conference on Advanced research in VLSI
Information Processing Letters
Journal of Parallel and Distributed Computing
IEEE Transactions on Parallel and Distributed Systems
A simple architecture for constant time sorting machines
ACM SIGARCH Computer Architecture News
Associative Nets: A Graph-Based Parallel Computing Model
IEEE Transactions on Computers
Efficient List Ranking Algorithms on Reconfigurable Mesh
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
| Hi-index | 14.98 |
We present a constant time sorting algorithm by adopting a 3D reconfigurable mesh with only O(n/sup 3/2/) processors. Our algorithm is developed on an n/sup 1/2//spl times/n/sup 1/2//spl times/n/sup 1/2/ 3-D reconfigurable mesh. Moreover, we further extend the result to k-dimensional reconfigurable meshes for k/spl ges/3. Consequently, an O(4/sup k+1/) time sorting algorithm is obtained by adopting an n/sup 1/(k-1)//spl times/n/sup 1/(k-1)//spl times/.../spl times/n/sup 1/(k-1)/k-D reconfigurable mesh of size O(n/sup 1+1/(k-1)/). Hence, constant time sorting using O(n/sup 1+/spl epsiv//) processors, where O/spl epsiv//spl Lt/1, can be realized by adopting reconfigurable meshes of high dimensions.