Storage-efficient, deadlock-free packet routing algorithms for torus networks
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 43 (12), 1376-1385
- https://doi.org/10.1109/12.338097
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- High Performance Communications In Processor NetworksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Adaptive deadlock-free worm-hole routing in hypercubesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- The turn model for adaptive routingPublished by Association for Computing Machinery (ACM) ,1992
- The chaos router: a practical application of randomization in network routingPublished by Association for Computing Machinery (ACM) ,1990
- Deadlock-free message routing in multicomputer networksDistributed Computing, 1989
- Prevention of Store-and-Forward Deadlock in Computer NetworksIEEE Transactions on Communications, 1985
- Deadlock-Free Packet Switching NetworksSIAM Journal on Computing, 1981
- Prevention of Deadlocks in Packet-Switched Data Transport SystemsIEEE Transactions on Communications, 1981
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979