Article

Free access

The interaction between virtual channel flow control and adaptive routing in wormhole networks

Authors:

Swaminathan Ramany,

Derek EagerAuthors Info & Claims

ICS '94: Proceedings of the 8th international conference on Supercomputing

Pages 136 - 145

https://doi.org/10.1145/181181.181327

Published: 16 July 1994 Publication History

Abstract

Multiprocessor interconnection networks based on low dimensional mesh or torus topologies and employing wormhole switching have become increasingly popular. Two concepts that have been proposed to improve the performance of such networks are Virtual Channel Flow Control (VCFC) and adaptive routing. Some previous studies have, however, found the latter technique to yield disappointing performance under uniform traffic patterns, while in this work we show that the former technique may result in degraded performance under certain non-uniform traffic patterns.

This paper studies the interaction between VCFC and adaptive routing. It is shown that each of these techniques may yield unsatisfactory performance only when used in isolation, and that through their appropriate combination uniformly improved performance can be achieved. The consistent performance improvement and the magnitude of the performance improvement in some cases offers compelling motivation for implementing a combination of VCFC and adaptive routing in future machines.

References

[1]

A. AgarwM, "Lim~s of Interconnect~n Network Performance', IEEE Transactions on Parallel and Distributed Systems, Vol. 2, No. 4, Oct. 1991, pp. 398-412.]]

Digital Library

[2]

H.G. Badr and S. Podar, "An OptimM Shortes~Path Routing Poficy for Network Computers w~h Regular Mesh-Connected Topologies", IEEE Transactions on Computers, Vol. 38, No. 10, Oct. 1989, pp. 1362-1371.]]

Digital Library

[3]

P.E. Berman, L. Gravano, G.D. Pifarre and J.L.C. Sanz, "Adaptive Deadlock- and Livelock-Free Routing with AU MinimM Paths in Torus NetworkS, Proceedings of the 4th Annual A CM Symposium on Parallel A~orithms and Architectures, June 1992.]]

Digital Library

[4]

R.V. Boppana and S. ChMasani, "A Compa~son of Adaptive Wormhole Routing Algorithm~, Proceedings of the 20th Annual Symposium on Computer Architecture, May 1993, pp. 351-360.]]

Digital Library

[5]

A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-cost Adaptive Networks for Mulfiprocessors", Proceedings of the 19th Annual Symposium on Computer Architecture, May 1992, pp. 278-287.]]

Digital Library

[6]

W.J. Dally, "Vi~uM-Channel Flow Control", IEEE Transactions on Parallel and Distributed Systems, Vol. 3, No. 2, March 1992, pp. 194-205.]]

Digital Library

[7]

W.J. Dally and C.L. S~tz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks", IEEE Transactions on Computers, Vol. 36, No. 5, May 1987, pp. 54~553.]]

Digital Library

[8]

J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormho~ Networks', IEEE Tran~action~ on Parallel and Distributed Systems, Vol. 4, No. 12, Dec. 1993, pp. 1320-1331.]]

Digital Library

[9]

W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Mult~omputer Networks UAng V~tuA Chann~s', IEEE Transac~ons on Parallel and Distributed Systems, Vol. 4, No. 4, April 1993, pp. 466-475.]]

Digital Library

[10]

C.J. Glass and L.M. Ni, "The Turn Mod~ of Adaptive Routing", Proceedings of the 19th Annual Symposium on Computer Architecture, May 1992, pp. 278-287.]]

Digital Library

[11]

C.J. Glass and L.M. Ni, "Adaptive Routing in Mesh- Connected Networks", Technical Report MSU-CPS- ACS-45, M~higan State University, Oct. 1991.]]

[12]

C.R. Jesshope, P.R. Miller and J.T. Yantchev, "High Performance Communications in Processor Networks", Proceedings of the 16th Annual Symposium on Computer Architecture, May 1989, pp. 150-157.]]

Digital Library

[13]

D.H. Linder and J.C. Harden, "An Adaptive and Fault To,rant Wormho~ Routing Strategy for k-ary n-cubes", 1EEE Transac~ons on Computers, Vol. 40, No. 1, Jan. 1991, pp. 2-12.]]

Digital Library

[14]

L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks", IEEE Compute~ Vol. 26, No. 2, Feb. 1993, pp. 62-76.]]

Digital Library

[15]

G.F. Pfister and V.A. Norton, "Hot Spot Contention and Combining in Mult~tage Interconnection Networks", IEEE Transactions on Computers, Vol. 34, No. 10, Oct. 1985, pp. 943-948.]]

[16]

L. Schwiebert and D.N. Jayasimha, "OptimM Fully Adaptive Wormho~ Routing for Meshes", Proceedings of Supercomputing 199& Nov. 1993, pp. 782-791.]]

Digital Library

[17]

C. Su and K.G. Shin, "Adap~ve Deadlock-Free Routing in Multicomputers U~ng Only One Extra Virtual Channel", Proceedings of the 1993 International Conference on Parallel Processin~ Aug. 1993, Vol. I, pp. 227-231.]]

Digital Library

[18]

H. Sullivan and T.R. Bashkow, "A Large Scale, Homogeneous, Fury D~tfibuted Paralld Machine", Proceedings of the 4th Annual Symposium on Computer Architecture, Mar. 1977, pp. 105-124.]]

Digital Library

Cited By

Vaidya ASivasubramaniam ADas C(2001)Impact of Virtual Channels and Adaptive Routing on Application PerformanceIEEE Transactions on Parallel and Distributed Systems10.1109/71.91087512:2(223-237)Online publication date: 1-Feb-2001
https://dl.acm.org/doi/10.1109/71.910875
Daniel SShin KYun S(1999)A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.74484110:1(62-75)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1109/71.744841
Basak DPanda D(1998)Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.6792189:5(481-496)Online publication date: 1-May-1998
https://dl.acm.org/doi/10.1109/71.679218
Show More Cited By

Index Terms

The interaction between virtual channel flow control and adaptive routing in wormhole networks
1. Computer systems organization
  1. Architectures
    1. Parallel architectures
      1. Interconnection architectures
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks was proposed in [12], [16]. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic ...
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 ...
A new theory of deadlock-free adaptive multicast routing in wormhole networks
SPDP '93: Proceedings of the 1993 5th IEEE Symposium on Parallel and Distributed Processing

A theory for the design of deadlock-free adaptive routing algorithms for wormhole networks has been proposed previously. This theory supplies the sufficient conditions for an adaptive routing algorithm to be deadlock-free, even when there are cyclic ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICS '94: Proceedings of the 8th international conference on Supercomputing

July 1994

452 pages

ISBN:0897916654

DOI:10.1145/181181

Chairmen:
John Gurd
Univ. of Manchester, Manchester, UK
,
William Jalby
Univ. de Versailles, France

Copyright © 1994 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

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 16 July 1994

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

ICS94

Sponsor:

SIGARCH

ICS94: International Conference on Supercomputing '94

July 11 - 15, 1994

Manchester, England

Acceptance Rates

ICS '94 Paper Acceptance Rate 45 of 114 submissions, 39%;

Overall Acceptance Rate 629 of 2,180 submissions, 29%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

6
Total Citations
View Citations
322
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)4

Reflects downloads up to 04 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Vaidya ASivasubramaniam ADas C(2001)Impact of Virtual Channels and Adaptive Routing on Application PerformanceIEEE Transactions on Parallel and Distributed Systems10.1109/71.91087512:2(223-237)Online publication date: 1-Feb-2001
https://dl.acm.org/doi/10.1109/71.910875
Daniel SShin KYun S(1999)A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.74484110:1(62-75)Online publication date: 1-Jan-1999
https://dl.acm.org/doi/10.1109/71.744841
Basak DPanda D(1998)Alleviating Consumption Channel Bottleneck in Wormhole-Routed k-ary n-Cube SystemsIEEE Transactions on Parallel and Distributed Systems10.1109/71.6792189:5(481-496)Online publication date: 1-May-1998
https://dl.acm.org/doi/10.1109/71.679218
Ciciani BColajanni MPaolucci C(1998)Performance evaluation of deterministic wormhole routing in k-ary n-cubesParallel Computing10.1016/S0167-8191(98)00094-524:14(2053-2075)Online publication date: 1-Dec-1998
https://dl.acm.org/doi/10.1016/S0167-8191%2898%2900094-5
Ciciani BPaolucci CColajanni M(1997)An Accurate Model for the Performance Analysis of Deterministic Wormhole RoutingProceedings of the 11th International Symposium on Parallel Processing10.5555/645607.661654Online publication date: 1-Apr-1997
https://dl.acm.org/doi/10.5555/645607.661654
Feng WShin KWallach SZima H(1997)Impact of selection functions on routing algorithm performance in multicomputer networksProceedings of the 11th international conference on Supercomputing10.1145/263580.263616(132-139)Online publication date: 11-Jul-1997
https://dl.acm.org/doi/10.1145/263580.263616

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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

Media

Figures

Other

Tables

View Table of Contents