The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Compressionless routing: a framework for adaptive and fault-tolerant routing
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
Journal of the ACM (JACM)
The Case for Chaotic Adaptive Routing
IEEE Transactions on Computers
A new method to make communication latency uniform: distributed routing balancing
ICS '99 Proceedings of the 13th international conference on Supercomputing
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Networks, Routers and Transputers: Function, Performance and Applications
Networks, Routers and Transputers: Function, Performance and Applications
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Distributed Routing Balancing for Interconnection Network Communication
HIPC '98 Proceedings of the Fifth International Conference on High Performance Computing
Avoiding Communication Hot-Spots in Interconnection Networks
HICSS '99 Proceedings of the Thirty-second Annual Hawaii International Conference on System Sciences-Volume 8 - Volume 8
| Hi-index | 0.00 |
Distributed Routing Balancing (DRB) is a method developed to uniformly balance communication traffic over the interconnection network. DRB takes a similar approach to communications as load balancing does to processes in a distributed environment. The key ideas behind DRB are to distribute communication load based on limited and load-controlled path expansion, in order to maintain low message latency. In this paper, we present an exhaustive evaluation of DRB that shows that the method presents low overhead and is robust with respect to the accuracy of the monitoring information it uses, and we compare its latency performance against other state-of-the-art routing methods.