Optimal routing algorithms for mesh-connected processor arrays
- 1 December 1992
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 8 (1-6) , 21-38
- https://doi.org/10.1007/bf01758834
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Optimal sorting on multi-dimensionally mesh-connected computersPublished by Springer Nature ,2006
- Lower bounds for sorting on mesh-connected architecturesActa Informatica, 1987
- The distance bound for sorting on mesh-connected processor arrays is tightPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Permutations on Illiac IV-Type NetworksIEEE Transactions on Computers, 1986
- Systolic Sorting on a Mesh-Connected NetworkIEEE Transactions on Computers, 1985
- An Efficient Implementation of Batcher's Odd-Even Merge Algorithm and Its Application in Parallel Sorting SchemesIEEE Transactions on Computers, 1983
- Data broadcasting in SIMD computersIEEE Transactions on Computers, 1981
- Design of a Massively Parallel ProcessorIEEE Transactions on Computers, 1980
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- Implementation of Permutation Functions in Illiac IV-Type ComputersIEEE Transactions on Computers, 1976