Flit-serial packet routing on meshes and tori
- 1 August 1996
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 29 (4), 311-330
- https://doi.org/10.1007/bf01192690
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Deterministic permutation routing on meshesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple path selection for optimal routing on processor arraysPublished by Association for Computing Machinery (ACM) ,1992
- Matching the bisection bound for routing and sorting on the meshPublished by Association for Computing Machinery (ACM) ,1992
- Fast algorithms for bit-serial routing on a hypercubeTheory of Computing Systems, 1991
- A guided tour of chernoff boundsInformation Processing Letters, 1990
- Routing and sorting on mesh-connected arraysPublished by Springer Nature ,1988
- Optimal routing algorithms for mesh-connected processor arraysPublished by Springer Nature ,1988
- Deadlock-Free Message Routing in Multiprocessor Interconnection NetworksIEEE Transactions on Computers, 1987
- The torus routing chipDistributed Computing, 1986
- Sorting on a mesh-connected parallel computerCommunications of the ACM, 1977