An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks
- 1 January 1987
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 226-241
- https://doi.org/10.1007/3-540-18625-5_53
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- The distance bound for sorting on mesh-connected processor arrays is tightPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Some parallel sorts on a mesh-connected processor array and their time efficiencyJournal of Parallel and Distributed Computing, 1986
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986
- Systolic Sorting on a Mesh-Connected NetworkIEEE Transactions on Computers, 1985
- Parallel Communication With Limited BuffersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- 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
- Universal schemes for parallel communicationPublished by Association for Computing Machinery (ACM) ,1981
- An optimal routing algorithm for mesh-connected Parallel computersJournal of the ACM, 1980
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977