A Fast Algorithm for Computing a Histogram on Reconfigurable Mesh
IEEE Transactions on Pattern Analysis and Machine Intelligence
Reconfigurable Buses with Shift Switching: Concepts and Applications
IEEE Transactions on Parallel and Distributed Systems
Designing Efficient Parallel Algorithms on CRAP
IEEE Transactions on Parallel and Distributed Systems
The DMBC: architecture and fundamental operations
ICS '95 Proceedings of the 9th international conference on Supercomputing
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting
IEEE Transactions on Computers
Constructing Euclidean Minimum Spanning Trees and All Nearest Neighbors on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
Constant Time Algorithms for Computational Geometry on the Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
An Optimal Multiplication Algorithm on Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Sorting, Selection, and Routing on the Array with Reconfigurable Optical Buses
IEEE Transactions on Parallel and Distributed Systems
A Simple Voronoi Diagram Algorithm for a Reconfigurable Mesh
IEEE Transactions on Parallel and Distributed Systems
Constant-Time Algorithms for Constrained Triangulations on Reconfigurable Meshes
IEEE Transactions on Parallel and Distributed Systems
An Efficient General In-Place Parallel Sorting Scheme
The Journal of Supercomputing
An Optimal Algorithm for the Angle-Restricted All Nearest Neighbor Problem on the Reconfigurable
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A Java Applet to Visualize Algorithms on Reconfigurable Mesh
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Efficient List Ranking Algorithms on Reconfigurable Mesh
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Efficient Parallel Hierarchical Clustering Algorithms
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.02 |
An optimal sorting algorithm on the reconfigurable mesh is proposed. The algorithm sorts n numbers in constant time using n*n processors. The best known previous result uses O(n*nlog/sup 2/n) processors. The presented algorithm satisfies the AT/sup 2/ lower bound of Omega (n/sup 2/) for sorting n numbers in the word model of VLSI. Modification to the algorithm for area-time trade-off is shown, to achieve AT/sup 2/ optimality over 1脙or=T脙or= square root n. Previously, the bound was achieved over log n脙or=T脙or= square root n.