Adaptive routing in mesh-connected networks

Christopher J. Glass; Lionel M. Ni

doi:10.1109/ICDCS.1992.235060

Adaptive routing in mesh-connected networks

Christopher J. Glass, Lionel M. Ni

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

60 Citations (Scopus)

Abstract

It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduce communication latencies at high network throughputs. Simulations of policies for selecting output channels show that avoiding turns reduces latencies at high throughputs. Unrestricted nonminimal routing is found to reduce latencies slightly at low throughputs but increase latencies significantly at high throughputs. For nonuniform traffic patterns, a partially adaptive routing algorithm performs better than a nonadaptive one.

Original language	English
Title of host publication	Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	12-19
Number of pages	8
ISBN (Electronic)	0818628650
DOIs	https://doi.org/10.1109/ICDCS.1992.235060
Publication status	Published - 1992
Externally published	Yes
Event	12th International Conference on Distributed Computing Systems, ICDCS 1992 - Yokohama, Japan Duration: 9 Jun 1992 → 12 Jun 1992

Publication series

Name	Proceedings - International Conference on Distributed Computing Systems
Volume	1992-June

Conference

Conference	12th International Conference on Distributed Computing Systems, ICDCS 1992
Country/Territory	Japan
City	Yokohama
Period	9/06/92 → 12/06/92

Bibliographical note

Publisher Copyright:
© 1992 IEEE.

Access to Document

10.1109/ICDCS.1992.235060

Cite this

Glass, C. J., & Ni, L. M. (1992). Adaptive routing in mesh-connected networks. In Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992 (pp. 12-19). Article 235060 (Proceedings - International Conference on Distributed Computing Systems; Vol. 1992-June). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICDCS.1992.235060

@inproceedings{f0b63fbdcf57453b8b64ee35ed3cb6b2,

title = "Adaptive routing in mesh-connected networks",

abstract = "It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduce communication latencies at high network throughputs. Simulations of policies for selecting output channels show that avoiding turns reduces latencies at high throughputs. Unrestricted nonminimal routing is found to reduce latencies slightly at low throughputs but increase latencies significantly at high throughputs. For nonuniform traffic patterns, a partially adaptive routing algorithm performs better than a nonadaptive one.",

author = "Glass, \{Christopher J.\} and Ni, \{Lionel M.\}",

note = "Publisher Copyright: {\textcopyright} 1992 IEEE.; 12th International Conference on Distributed Computing Systems, ICDCS 1992 ; Conference date: 09-06-1992 Through 12-06-1992",

year = "1992",

doi = "10.1109/ICDCS.1992.235060",

language = "English",

series = "Proceedings - International Conference on Distributed Computing Systems",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "12--19",

booktitle = "Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992",

}

Glass, CJ & Ni, LM 1992, Adaptive routing in mesh-connected networks. in Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992., 235060, Proceedings - International Conference on Distributed Computing Systems, vol. 1992-June, Institute of Electrical and Electronics Engineers Inc., pp. 12-19, 12th International Conference on Distributed Computing Systems, ICDCS 1992, Yokohama, Japan, 9/06/92. https://doi.org/10.1109/ICDCS.1992.235060

Adaptive routing in mesh-connected networks. / Glass, Christopher J.; Ni, Lionel M.
Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992. Institute of Electrical and Electronics Engineers Inc., 1992. p. 12-19 235060 (Proceedings - International Conference on Distributed Computing Systems; Vol. 1992-June).

Research output: Chapter in Book/Conference Proceeding/Report › Conference Paper published in a book › peer-review

TY - GEN

T1 - Adaptive routing in mesh-connected networks

AU - Glass, Christopher J.

AU - Ni, Lionel M.

PY - 1992

Y1 - 1992

N2 - It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduce communication latencies at high network throughputs. Simulations of policies for selecting output channels show that avoiding turns reduces latencies at high throughputs. Unrestricted nonminimal routing is found to reduce latencies slightly at low throughputs but increase latencies significantly at high throughputs. For nonuniform traffic patterns, a partially adaptive routing algorithm performs better than a nonadaptive one.

AB - It is shown that wormhole routing in mesh-connected networks can be deadlock free and adaptive without the addition of channels to the basic topology. Several partially adaptive routing algorithms for 2-D and 3-D meshes are described and simulated for a variety of conditions. Simulations of policies for selecting input channels show that transmitting extra information in the header flits can reduce communication latencies at high network throughputs. Simulations of policies for selecting output channels show that avoiding turns reduces latencies at high throughputs. Unrestricted nonminimal routing is found to reduce latencies slightly at low throughputs but increase latencies significantly at high throughputs. For nonuniform traffic patterns, a partially adaptive routing algorithm performs better than a nonadaptive one.

UR - https://www.scopus.com/pages/publications/78149245965

U2 - 10.1109/ICDCS.1992.235060

DO - 10.1109/ICDCS.1992.235060

M3 - Conference Paper published in a book

AN - SCOPUS:78149245965

T3 - Proceedings - International Conference on Distributed Computing Systems

SP - 12

EP - 19

BT - Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 12th International Conference on Distributed Computing Systems, ICDCS 1992

Y2 - 9 June 1992 through 12 June 1992

ER -

Adaptive routing in mesh-connected networks

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this