(k−k) Routing on multidimensional mesh-connected arrays
- 1 February 1991
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 11 (2) , 146-155
- https://doi.org/10.1016/0743-7315(91)90120-x
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- Intensive hypercube communication Prearranged communication in link-bound machinesJournal of Parallel and Distributed Computing, 1990
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- The distance bound for sorting on mesh-connected processor arrays is tightPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977