Sorting in mesh connected multiprocessors
- 1 January 1992
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 3 (5) , 626-632
- https://doi.org/10.1109/71.159046
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Orthogonal graphs for the construction of a class of interconnection networksIEEE Transactions on Parallel and Distributed Systems, 1991
- Deterministic sorting in nearly logarithmic time on the hypercube and related computersPublished by Association for Computing Machinery (ACM) ,1990
- Analysis and applications of the orthogonal access multiprocessorJournal of Parallel and Distributed Computing, 1989
- Load balancing, selection sorting on the hypercubePublished by Association for Computing Machinery (ACM) ,1989
- Parallel sorting in two-dimensional VLSI models of computationIEEE Transactions on Computers, 1989
- Sorting in constant number of row and column phases on a meshAlgorithmica, 1988
- Some parallel sorts on a mesh-connected processor array and their time efficiencyJournal of Parallel and Distributed Computing, 1986
- Tight Bounds on the Complexity of Parallel SortingIEEE Transactions on Computers, 1985
- A Robust Sorting NetworkIEEE Transactions on Computers, 1985
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979