Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology

  • Authors:
  • F. Silla;J. Duato

  • Affiliations:
  • -;-

  • Venue:
  • HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Networks of workstations are emerging as a cost-effectivealternative to parallel computers. The inter-connectionbetween workstations usually relies on switch-basednetworks with irregular topologies. This irregularitymakes routing and deadlock avoidance quite complicated.Current proposals avoid deadlock by removing cyclicdependencies between channels and therefore, manymessages are routed along non-minimal paths, increasinglatency and wasting resources.In this paper, we propose a general methodology for thedesign of adaptive routing algorithms for networks withirregular topology that improves over a previously proposedone by reducing the probability of routing over non-minimalpaths. The resulting routing algorithms allowmessages to follow minimal paths in most cases, reducingmessage latency and increasing network throughput. As anexample of application, we propose an improved adaptiverouting algorithm for Autonet.