By Topic

GOAL: a load-balanced adaptive routing algorithm for torus networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Arjun Singh ; Comput. Syst. Lab., Stanford Univ., CA, USA ; W. J. Dally ; A. K. Gupta ; B. Towles

We introduce a load balanced adaptive routing algorithm for torus networks, GOAL - globally oblivious adaptive locally - that provides high throughput on adversarial traffic patterns, matching or exceeding fully randomized routing and exceeding the worst case performance of Chaos (K. Bolding et al., 1997), RLB (A. Singh et al., 2002), and minimal routing (L. Gravano et al., 1994) by more than 40%. GOAL also preserves locality to provide up to 4.6* the throughput of fully randomized routing (L. G. Valiant, 1982) on local traffic. GOAL achieves global load balance by randomly choosing the direction to route in each dimension. Local load balance is then achieved by routing in the selected directions adaptively. We compare the throughput, latency, stability and hot spot performance of GOAL to six previously published routing algorithms on six specific traffic patterns and 1000 randomly generated permutations.

Published in:

Computer Architecture, 2003. Proceedings. 30th Annual International Symposium on

Date of Conference:

9-11 June 2003