An optimal shortest-path routing policy for network computers with regular mesh-connected topologies
- 1 January 1989
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 38 (10), 1362-1371
- https://doi.org/10.1109/12.35831
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Towards performance improvement of cut-through switching in computer networksPerformance Evaluation, 1986
- Dynamically Restructurable Fault-Tolerant Processor Network ArchitecturesIEEE Transactions on Computers, 1985
- Concurrent VLSI ArchitecturesIEEE Transactions on Computers, 1984
- Staged circuit switching for network computersPublished by Association for Computing Machinery (ACM) ,1983
- Cost-Performance Bounds for Multimicrocomputer NetworksIEEE Transactions on Computers, 1983
- Minimization of Interprocessor Communication for Parallel ComputationIEEE Transactions on Computers, 1982
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Analysis of Chordal Ring NetworkIEEE Transactions on Computers, 1981
- Virtual cut-through: A new computer communication switching techniqueComputer Networks (1976), 1979