Article

Adaptive channel queue routing on k-ary n-cubes

Authors:

William J. Dally,

Brian TowlesAuthors Info & Claims

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 11 - 19

https://doi.org/10.1145/1007912.1007915

Published: 27 June 2004 Publication History

Abstract

This paper introduces a new adaptive method, Channel Queue Routing (CQR), for load-balanced routing on k-ary n-cube interconnection networks. CQR estimates global congestion in the network from its channel queues while relying on the implicit network backpressure to transfer congestion information to these queues. It uses this estimate to decide the directions to route in each dimension. It further load balances the network by routing in the selected directions adaptively. The only other algorithm that uses global congestion in its routing decision is the Globally Adaptive Load-Balance (GAL) algorithm introduced in [13]. GAL performs better than any other known routing algorithm on a wide variety of throughput and latency metrics. However, there are four serious issues with GAL. First, it has very high latency once it starts routing traffic non-minimally. Second, it is slow to adapt to changes in traffic. Third, it requires a complex method to achieve stability. Finally, it is complex to implement. These issues are all related to GAL's use of injection queue length to infer global congestion. CQR uses channel queues rather than injection queues to estimate global congestion. In doing so, it overcomes the limitations of GAL described above while matching its high performance on all the performance metrics described in [13]. CQR gives much lower latency than GAL at loads where non-minimal routing is required. It adapts rapidly to changes in traffic, is unconditionally stable, and is simple to implement.

References

[1]

D. Bertsekas and R. Gallager. Data Networks: Second Edition. Prentice-Hall, 1992.

Digital Library

[2]

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

Digital Library

[3]

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.

[4]

P. Gaughan and S. Yalamanchili. Adaptive routing protocols for hypercube interconnection networks. IEEE Computer, 26(5):12--23, May 1993.

Digital Library

[5]

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

[6]

J. Jackson. Jobshop-like queueing systems. Management Science, 10:131--142, 1963.

Digital Library

[7]

L. Kleinrock. Queueing Systems: Volume II. John Wiley, 1975.

[8]

M. Mitzenmacher. Bounds on the greedy routing algorithm for array networks. In Proc. Symposium on Parallel Algorithms and Architectures SPAA, pages 346--353, Cape May, New Jersey, June 1994.

Digital Library

[9]

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

[10]

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.

[11]

A. Singh, W. J. Dally, A. K. Gupta, and B. Towles. GOAL: A load-balanced adaptive routing algorithm for torus networks. In Proc. 30th Annual International Symposium on Computer Architecture ISCA, San Diego, California, 2003.

Digital Library

[12]

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

Digital Library

[13]

A. Singh, W. J. Dally, B. Towles, and A. K. Gupta. Globally adaptive load-balanced routing on tori. Computer Architecture Letters, 3, Mar 2004.

Digital Library

[14]

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

Digital Library

[15]

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

Digital Library

Cited By

Zhang X(2023)Power: Multi-Capatibility Adaptive Routing for Network-an-Chips2023 3rd International Conference on Neural Networks, Information and Communication Engineering (NNICE)10.1109/NNICE58320.2023.10105691(751-754)Online publication date: 24-Feb-2023
https://doi.org/10.1109/NNICE58320.2023.10105691
Alle MSamed NKim J(2022)Niosomes: A Smart Drug Carrier Synthesis, Properties and ApplicationsSmart Nanomaterials in Biomedical Applications10.1007/978-3-030-84262-8_16(449-486)Online publication date: 1-Jan-2022
https://doi.org/10.1007/978-3-030-84262-8_16
Gorgues MXiang DFlich JYu ZDuato J(2014)Achieving balanced buffer utilization with a proper co-design of flow control and routing algorithm2014 Eighth IEEE/ACM International Symposium on Networks-on-Chip (NoCS)10.1109/NOCS.2014.7008758(25-32)Online publication date: Sep-2014
https://doi.org/10.1109/NOCS.2014.7008758
Show More Cited By

Index Terms

Adaptive channel queue routing on k-ary n-cubes
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes

The concept of virtual channels is extended to multiple virtual communication systems that provide adaptability and fault tolerance in addition to being deadlock-free. A channel dependency graph is taken as the definition of what connections are ...
A simple mathematical model of adaptive routing in wormhole k-ary n-cubes
SAC '02: Proceedings of the 2002 ACM symposium on Applied computing

Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably ...
A comparison of adaptive wormhole routing algorithms
ISCA '93: Proceedings of the 20th annual international symposium on computer architecture

Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '04: Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures

June 2004

332 pages

ISBN:1581138407

DOI:10.1145/1007912

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Micah Adler
University of Massachusetts

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA04

Sponsor:

SPAA04: 16th ACM Symposium on Parallelism in Algorithms and Architectures 2004

June 27 - 30, 2004

Barcelona, Spain

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Upcoming Conference

SPAA '25

Sponsor:
sigact
sigact

37th ACM Symposium on Parallelism in Algorithms and Architectures

July 28 - August 1, 2025

Portland , OR , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

42
Total Citations
View Citations
285
Total Downloads

Downloads (Last 12 months)2
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Zhang X(2023)Power: Multi-Capatibility Adaptive Routing for Network-an-Chips2023 3rd International Conference on Neural Networks, Information and Communication Engineering (NNICE)10.1109/NNICE58320.2023.10105691(751-754)Online publication date: 24-Feb-2023
https://doi.org/10.1109/NNICE58320.2023.10105691
Alle MSamed NKim J(2022)Niosomes: A Smart Drug Carrier Synthesis, Properties and ApplicationsSmart Nanomaterials in Biomedical Applications10.1007/978-3-030-84262-8_16(449-486)Online publication date: 1-Jan-2022
https://doi.org/10.1007/978-3-030-84262-8_16
Gorgues MXiang DFlich JYu ZDuato J(2014)Achieving balanced buffer utilization with a proper co-design of flow control and routing algorithm2014 Eighth IEEE/ACM International Symposium on Networks-on-Chip (NoCS)10.1109/NOCS.2014.7008758(25-32)Online publication date: Sep-2014
https://doi.org/10.1109/NOCS.2014.7008758
Ramanujam RLin B(2013)Destination-based congestion awareness for adaptive routing in 2D mesh networksACM Transactions on Design Automation of Electronic Systems10.1145/250505518:4(1-27)Online publication date: 25-Oct-2013
https://dl.acm.org/doi/10.1145/2505055
Fu BHan YLi HLi X(2013)The Abacus Turn ModelRouting Algorithms in Networks-on-Chip10.1007/978-1-4614-8274-1_4(69-103)Online publication date: 25-Sep-2013
https://doi.org/10.1007/978-1-4614-8274-1_4
Nitin Chauhan D(2012)Comparative analysis of Traffic Patterns on k-ary n-tree using adaptive algorithms based on Burton Normal FormThe Journal of Supercomputing10.1007/s11227-010-0454-759:2(569-588)Online publication date: 1-Feb-2012
https://dl.acm.org/doi/10.1007/s11227-010-0454-7
Abts DKim J(2011)High Performance Datacenter Networks: Architectures, Algorithms, and OpportunitiesSynthesis Lectures on Computer Architecture10.2200/S00341ED1V01Y201103CAC0146:1(1-115)Online publication date: 8-Mar-2011
https://doi.org/10.2200/S00341ED1V01Y201103CAC014
Fu BHan YMa JLi HLi X(2011)An abacus turn model for time/space-efficient reconfigurable routingACM SIGARCH Computer Architecture News10.1145/2024723.200009639:3(259-270)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/2024723.2000096
Fu BHan YMa JLi HLi XIyer RYang QGonzález A(2011)An abacus turn model for time/space-efficient reconfigurable routingProceedings of the 38th annual international symposium on Computer architecture10.1145/2000064.2000096(259-270)Online publication date: 4-Jun-2011
https://dl.acm.org/doi/10.1145/2000064.2000096
Rastogi RNitin Chauhan D(2011)3-Disjoint Paths Fault-tolerant Omega Multi-stage Interconnection Network with Reachable Sets and Coloring SchemeProceedings of the 2011 UKSim 13th International Conference on Modelling and Simulation10.1109/UKSIM.2011.111(551-556)Online publication date: 30-Mar-2011
https://dl.acm.org/doi/10.1109/UKSIM.2011.111
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 Table of Conten