A theory of wormhole routing in parallel computers
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 45 (6) , 704-713
- https://doi.org/10.1109/12.506426
Abstract
No abstract availableThis publication has 22 references indexed in Scilit:
- Hot-potato worm routing is almost as easy as store-and-forward packet routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Modeling wormhole routing in a hypercubePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Virtual-channel flow controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On bit-serial packet routing for the mesh and the torusPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Exact analysis of hot-potato routingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1992
- On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspectsPublished by Springer Nature ,1991
- Fast algorithms for bit-serial routing on a hypercubePublished by Association for Computing Machinery (ACM) ,1990
- Average case analysis of greedy routing algorithms on arraysPublished by Association for Computing Machinery (ACM) ,1990
- Parallel Communication With Limited BuffersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1984
- Randomized parallel communication (Preliminary Version)Published by Association for Computing Machinery (ACM) ,1982