Efficient fully adaptive wormhole routing in n-dimensional meshes

Younes M. Boura, Chitaranjan Das

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Citations (Scopus)

Abstract

An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed in this paper. The routing algorithm provides full adaptivity at a cost of one additional virtual channel per physical channel irrespective of the number of dimensions of the network. The algorithm is based on dividing the network graph into two acyclic graphs that contain all of the physical channels in the system. Virtual channels are classified as either waiting or nonwaiting channels. Busy channels that a message waits for to become available are classified as waiting channels, otherwise they are classified as nonwaiting channels. Thus, a message considers nonwaiting channels first to reach its destination. If all nonwaiting channels are busy, the message considers waiting channels. Messages acquire waiting channels in two phases. In each phase, waiting channels belonging to one acyclic network graph are traversed. This 2-phase routing algorithm could be either minimal or nonminimal. However, in this paper we concentrate on minimal routing. It is demonstrated that this adaptive routing algorithm can utilize the virtual paths (channels) between any two nodes more efficiently than any of the present algorithms with the same hardware requirement.

Original languageEnglish (US)
Title of host publicationProceedings - International Conference on Distributed Computing Systems
PublisherIEEE
Pages589-596
Number of pages8
StatePublished - 1994
EventProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems - Poznan, Pol
Duration: Jun 21 1994Jun 24 1994

Other

OtherProceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems
CityPoznan, Pol
Period6/21/946/24/94

Fingerprint

Routing algorithms
Adaptive algorithms
Hardware
Costs

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Boura, Y. M., & Das, C. (1994). Efficient fully adaptive wormhole routing in n-dimensional meshes. In Proceedings - International Conference on Distributed Computing Systems (pp. 589-596). IEEE.
Boura, Younes M. ; Das, Chitaranjan. / Efficient fully adaptive wormhole routing in n-dimensional meshes. Proceedings - International Conference on Distributed Computing Systems. IEEE, 1994. pp. 589-596
@inproceedings{595f60c13d1f47c882034b4b9985dfe4,
title = "Efficient fully adaptive wormhole routing in n-dimensional meshes",
abstract = "An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed in this paper. The routing algorithm provides full adaptivity at a cost of one additional virtual channel per physical channel irrespective of the number of dimensions of the network. The algorithm is based on dividing the network graph into two acyclic graphs that contain all of the physical channels in the system. Virtual channels are classified as either waiting or nonwaiting channels. Busy channels that a message waits for to become available are classified as waiting channels, otherwise they are classified as nonwaiting channels. Thus, a message considers nonwaiting channels first to reach its destination. If all nonwaiting channels are busy, the message considers waiting channels. Messages acquire waiting channels in two phases. In each phase, waiting channels belonging to one acyclic network graph are traversed. This 2-phase routing algorithm could be either minimal or nonminimal. However, in this paper we concentrate on minimal routing. It is demonstrated that this adaptive routing algorithm can utilize the virtual paths (channels) between any two nodes more efficiently than any of the present algorithms with the same hardware requirement.",
author = "Boura, {Younes M.} and Chitaranjan Das",
year = "1994",
language = "English (US)",
pages = "589--596",
booktitle = "Proceedings - International Conference on Distributed Computing Systems",
publisher = "IEEE",

}

Boura, YM & Das, C 1994, Efficient fully adaptive wormhole routing in n-dimensional meshes. in Proceedings - International Conference on Distributed Computing Systems. IEEE, pp. 589-596, Proceedings of the 1994 IEEE 14th International Conference on Distributed Computing Systems, Poznan, Pol, 6/21/94.

Efficient fully adaptive wormhole routing in n-dimensional meshes. / Boura, Younes M.; Das, Chitaranjan.

Proceedings - International Conference on Distributed Computing Systems. IEEE, 1994. p. 589-596.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Efficient fully adaptive wormhole routing in n-dimensional meshes

AU - Boura, Younes M.

AU - Das, Chitaranjan

PY - 1994

Y1 - 1994

N2 - An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed in this paper. The routing algorithm provides full adaptivity at a cost of one additional virtual channel per physical channel irrespective of the number of dimensions of the network. The algorithm is based on dividing the network graph into two acyclic graphs that contain all of the physical channels in the system. Virtual channels are classified as either waiting or nonwaiting channels. Busy channels that a message waits for to become available are classified as waiting channels, otherwise they are classified as nonwaiting channels. Thus, a message considers nonwaiting channels first to reach its destination. If all nonwaiting channels are busy, the message considers waiting channels. Messages acquire waiting channels in two phases. In each phase, waiting channels belonging to one acyclic network graph are traversed. This 2-phase routing algorithm could be either minimal or nonminimal. However, in this paper we concentrate on minimal routing. It is demonstrated that this adaptive routing algorithm can utilize the virtual paths (channels) between any two nodes more efficiently than any of the present algorithms with the same hardware requirement.

AB - An efficient fully adaptive wormhole routing algorithm for n-dimensional meshes is developed in this paper. The routing algorithm provides full adaptivity at a cost of one additional virtual channel per physical channel irrespective of the number of dimensions of the network. The algorithm is based on dividing the network graph into two acyclic graphs that contain all of the physical channels in the system. Virtual channels are classified as either waiting or nonwaiting channels. Busy channels that a message waits for to become available are classified as waiting channels, otherwise they are classified as nonwaiting channels. Thus, a message considers nonwaiting channels first to reach its destination. If all nonwaiting channels are busy, the message considers waiting channels. Messages acquire waiting channels in two phases. In each phase, waiting channels belonging to one acyclic network graph are traversed. This 2-phase routing algorithm could be either minimal or nonminimal. However, in this paper we concentrate on minimal routing. It is demonstrated that this adaptive routing algorithm can utilize the virtual paths (channels) between any two nodes more efficiently than any of the present algorithms with the same hardware requirement.

UR - http://www.scopus.com/inward/record.url?scp=0028563549&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028563549&partnerID=8YFLogxK

M3 - Conference contribution

SP - 589

EP - 596

BT - Proceedings - International Conference on Distributed Computing Systems

PB - IEEE

ER -

Boura YM, Das C. Efficient fully adaptive wormhole routing in n-dimensional meshes. In Proceedings - International Conference on Distributed Computing Systems. IEEE. 1994. p. 589-596