A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
Journal of the ACM (JACM)
A Theory of Fault-Tolerant Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Adaptive Fault-tolerant Wormhole Routing in 2D Meshes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Fault-Tolerant Wormhole Routing Algorithms in Meshes in the Presence of Concave Faults
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Fault-Tolerant Routing in 2D Tori or Meshes Using Limited-Global-Safety Information
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
GOAL: a load-balanced adaptive routing algorithm for torus networks
Proceedings of the 30th annual international symposium on Computer architecture
Self-Tuned Congestion Control for Multiprocessor Networks
HPCA '01 Proceedings of the 7th International Symposium on High-Performance Computer Architecture
Deadlock-Free Dynamic Reconfiguration Schemes for Increased Network Dependability
IEEE Transactions on Parallel and Distributed Systems
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Globally Adaptive Load-Balanced Routing on Tori
IEEE Computer Architecture Letters
Cross-line: a globally adaptive control method of interconnection network
ISHPC'05/ALPS'06 Proceedings of the 6th international symposium on high-performance computing and 1st international conference on Advanced low power systems
Hi-index | 0.00 |
Large-scale interconnection networks require fault-tolerant features as well as high performance. Since a large-scale network consists of huge number of independent routers, effective globally-optimum algorithms are required. We introduce a quasi-global control mechanism to solve the problem and propose Fault-Tolerant Cross-Line as a novel selection function of routing algorithm. The proposed method makes use of fault location information as well as congestion information so that it can properly control under both faulty and congested situations. Preliminary evaluation results show essential effectiveness of the proposed method.