A 2 n -2 step algorithm for routing in an nxn array with constant size queues
- 1 March 1989
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 328-335
- https://doi.org/10.1145/72935.72970
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- Performance analysis of k-ary n-cube interconnection networksIEEE Transactions on Computers, 1990
- An optimal sorting algorithm for mesh connected computersPublished by Association for Computing Machinery (ACM) ,1986
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977