article

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

Authors:

William J. Dally,

Brian TowlesAuthors Info & Claims

ACM SIGARCH Computer Architecture News, Volume 31, Issue 2

Pages 194 - 205

https://doi.org/10.1145/871656.859641

Published: 01 May 2003 Publication History

Abstract

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 [2], RLB [14], and minimal routing [8] by more than 40%. GOAL also preserves locality to provide up to 4.6× the throughput of fully randomized routing [19] 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 1,000 randomly generated permutations.

References

[1]

G. Birkhoff. Tres observaciones sobre el algebra lineal. Univ. Nac. Tucumán Rev. Ser. A, 5:147--151, 1946.

[2]

K. Bolding, M. L. Fulgham, and L. Snyder. The case for chaotic adaptive routing. IEEE Transactions on Computers, 46(12):1281--1291, 1997.

Digital Library

[3]

W. J. Dally. Performance analysis of k-ary n-cube interconnection networks. IEEE Transactions on Computers, 39(6):775--785, 1990.

Digital Library

[4]

W. J. Dally. Virtual-channel flow control. IEEE Transactions on Parallel and Distributed Systems, 3(2):194--205, 1992.

Digital Library

[5]

W. J. Dally, P. Carvey, and L. Dennison. Architecture of the Avici terabit switch/router. In Proceedings of Hot Interconnects Symposium VI, August 1998, pages 41--50, 1998.

[6]

J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks An Engineering Approach. IEEE Press, 1997. Chapter 3: A Theory of Deadlock Avoidance.

Digital Library

[7]

J. Duato, S. Yalamanchili, and L. Ni. Interconnection Networks An Engineering Approach. IEEE Press, 1997. Chapter 9: Performance Evaluation.

Digital Library

[8]

L. Gravano, G. Pifarre, G. Pifarre, P. Berman, and J. Sanz. Adaptive deadlock- and livelock-free routing with all minimal paths in torus networks. IEEE Transactions on Parallel and Distributed Systems, 5(12):1233--1252, Dec. 1994.

Digital Library

[9]

D. Linder and J. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transaction on Computers, 40(1):2--12, Jan. 1991.

Digital Library

[10]

T. Nesson and S. L. Johnsson. ROMM routing on mesh and torus networks. In Proc. 7th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA'95, pages 275--287, Santa Barbara, California, 1995.

Digital Library

[11]

L.-S. Peh and W. J. Dally. A delay model for router microarchitectures,. IEEE Micro, 21(1):26--34, 2001.

Digital Library

[12]

G. Pfister. An Introduction to the InfiniBand Arechitecture (http://www.infinibadta.org). IEEE Press, 2001.

[13]

S. Scott and G. Thorson. The cray t3e network: adaptive routing in a high performance 3d torus. In Proceedings of Hot Interconnects Symposium IV, Aug. 1996.

[14]

A. Singh, W. J. Dally, B. Towles, and A. K. Gupta. Localitypreserving randomized routing on torus networks. In Proc. 12th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA'02, Winnipeg, Canada, 2002.

Digital Library

[15]

H. Sullivan, T. Bashkow, and D. Klappholz. A large scale, homogeneous, fully distributed parallel machine, ii. In Proceedings of the 4th Annual International Symposium on Computer Architecture., pages 118--124, Mar. 1977.

Digital Library

[16]

A. S. Tanenbaum. Computer Networks, 3rd ed. Prentice Hall, 1996. Pages 202--219.

Digital Library

[17]

B. Towles and W. J. Dally. Worst-case traffic for oblivious routing functions. In Proc. 12th Annual ACM Symposium on Parallel Algorithms and Architectures SPAA'02, Winnipeg, Canada, 2002.

Digital Library

[18]

A. K. V. and T. M. Pinkston. An efficient fully adaptive deadlock recovery scheme: Disha. In Proceedings of the 22nd Annual International Symposium on Computer Architecture., pages 201--210, Jun. 1995.

Digital Library

[19]

L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11(2):350--361, 1982.

Digital Library

Cited By

Xu DZhang TZhou W(2024)THCA: Three-Hop Congestion Awareness Routing Mechanism in WiNoCJournal of Circuits, Systems and Computers10.1142/S0218126625501051Online publication date: 26-Dec-2024
https://doi.org/10.1142/S0218126625501051
Shahrouz SBetz V(2024)The Road Less Traveled: Congestion-Aware NoC Placement and Packet Routing for FPGAs2024 34th International Conference on Field-Programmable Logic and Applications (FPL)10.1109/FPL64840.2024.00015(33-42)Online publication date: 2-Sep-2024
https://doi.org/10.1109/FPL64840.2024.00015
Mukosey ASemenov ATretiakov A(2023)Graph Based Routing Algorithm for Torus Topology and Its Evaluation for the Angara InterconnectJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.104765(104765)Online publication date: Sep-2023
https://doi.org/10.1016/j.jpdc.2023.104765
Show More Cited By

GOAL: a load-balanced adaptive routing algorithm for torus networks
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis

Recommendations

GOAL: a load-balanced adaptive routing algorithm for torus networks
ISCA '03: Proceedings of the 30th annual international symposium on Computer architecture

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 ...
GOAL: A parsimonious geographic routing protocol for large scale sensor networks

Geographic routing is well suited for large scale sensor networks, because its per node state is independent of the network size. However, the local minimum caused by holes/obstacles results in the worst-case path stretch of @W(c^2), where c is the path ...
Goal delegation without goals: BDI agents in harmony with OCMAS principles
MATES'12: Proceedings of the 10th German conference on Multiagent System Technologies

The BDI model is concerned with the rational action of an individual agent. At the multi-agent layer especially coordination among agents is an important factor that determines how overall system goals can be accomplished. Thus, from a software ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGARCH Computer Architecture News

ACM SIGARCH Computer Architecture News Volume 31, Issue 2

ISCA 2003

May 2003

422 pages

ISSN:0163-5964

DOI:10.1145/871656

Issue’s Table of Contents

ISCA '03: Proceedings of the 30th annual international symposium on Computer architecture
June 2003
432 pages
ISBN:0769519458
DOI:10.1145/859618
Conference Chair:
Allan Gottlieb
New York University & NEC Laboratories America
,
Program Chair:
Kai Li
Princeton University

Copyright © 2003 Authors.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2003

Published in SIGARCH Volume 31, Issue 2

Check for updates

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

151
Total Citations
View Citations
1,081
Total Downloads

Downloads (Last 12 months)32
Downloads (Last 6 weeks)1

Reflects downloads up to 25 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Xu DZhang TZhou W(2024)THCA: Three-Hop Congestion Awareness Routing Mechanism in WiNoCJournal of Circuits, Systems and Computers10.1142/S0218126625501051Online publication date: 26-Dec-2024
https://doi.org/10.1142/S0218126625501051
Shahrouz SBetz V(2024)The Road Less Traveled: Congestion-Aware NoC Placement and Packet Routing for FPGAs2024 34th International Conference on Field-Programmable Logic and Applications (FPL)10.1109/FPL64840.2024.00015(33-42)Online publication date: 2-Sep-2024
https://doi.org/10.1109/FPL64840.2024.00015
Mukosey ASemenov ATretiakov A(2023)Graph Based Routing Algorithm for Torus Topology and Its Evaluation for the Angara InterconnectJournal of Parallel and Distributed Computing10.1016/j.jpdc.2023.104765(104765)Online publication date: Sep-2023
https://doi.org/10.1016/j.jpdc.2023.104765
Wang YLi Y(2022)Load-Balancing Routing Algorithms for Reducing Packet Latency and Avoiding Deadlock in Datacenter Interconnection Networks2022 Tenth International Symposium on Computing and Networking Workshops (CANDARW)10.1109/CANDARW57323.2022.00011(261-267)Online publication date: Nov-2022
https://doi.org/10.1109/CANDARW57323.2022.00011
Lin BLea C(2022)Designing Nonblocking Networks With a General TopologyIEEE Access10.1109/ACCESS.2021.313973210(8399-8408)Online publication date: 2022
https://doi.org/10.1109/ACCESS.2021.3139732
Moudi MOthman M(2021)A survey on emerging issues in interconnection networksInternational Journal of Internet Technology and Secured Transactions10.1504/ijitst.2021.11351211:2(131-159)Online publication date: 1-Jan-2021
https://dl.acm.org/doi/10.1504/ijitst.2021.113512
Reza MLe T(2021)Reinforcement Learning Enabled Routing for High-Performance Networks-on-Chip2021 IEEE International Symposium on Circuits and Systems (ISCAS)10.1109/ISCAS51556.2021.9401790(1-5)Online publication date: May-2021
https://doi.org/10.1109/ISCAS51556.2021.9401790
Nasirian SFaghani FDaneshvar Farzanegan M(2021)Doughnutie: An efficient and low‐latency cloud data center network architectureConcurrency and Computation: Practice and Experience10.1002/cpe.633733:20Online publication date: 4-Jun-2021
https://doi.org/10.1002/cpe.6337
YOKOTA TOOTSU KOHKAWA T(2020)Genetic Node-Mapping Methods for Rapid Collective CommunicationsIEICE Transactions on Information and Systems10.1587/transinf.2018EDP7386E103.D:1(111-129)Online publication date: 1-Jan-2020
https://doi.org/10.1587/transinf.2018EDP7386
Siarohin AZen GMajtanovic CAlameda-Pineda XRicci ESebe N(2019)Increasing Image Memorability with Neural Style TransferACM Transactions on Multimedia Computing, Communications, and Applications10.1145/331178115:2(1-22)Online publication date: 5-Jun-2019
https://dl.acm.org/doi/10.1145/3311781
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents