An optimal sorting algorithm on reconfigurable mesh
- 2 January 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 130-137
- https://doi.org/10.1109/ipps.1992.223059
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Reconfigurable mesh algorithms for image shrinking, expanding, clustering, and template matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Parallel sorting in two-dimensional VLSI models of computationIEEE Transactions on Computers, 1989
- Array processor with multiple broadcastingJournal of Parallel and Distributed Computing, 1987
- Meshes with multiple busesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Optimal Bounds for Finding Maximum on Array of Processors with k Global BusesIEEE Transactions on Computers, 1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- Finding Maximum on an Array Processor with a Global BusIEEE Transactions on Computers, 1984
- Information Transfer in Distributed Computing with Applications to VLSIJournal of the ACM, 1984
- Mesh-Connected Computers with BroadcastingIEEE Transactions on Computers, 1983