Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes

A. Khonsari; A. Farahani; M. Ould-Khaoua

doi:10.1109/MASCOT.2002.1167076

Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes

A. Khonsari, A. Farahani, M. Ould-Khaoua

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. The paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

Original language	English
Title of host publication	Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS
Publisher	IEEE Computer Society
Pages	183-190
Number of pages	8
Volume	2002-January
ISBN (Print)	0769518400
DOIs	https://doi.org/10.1109/MASCOT.2002.1167076
Publication status	Published - 2002
Event	10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002 - Fort Worth, United States Duration: Oct 11 2002 → Oct 16 2002

Other

Other	10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002
Country/Territory	United States
City	Fort Worth
Period	10/11/02 → 10/16/02

ASJC Scopus subject areas

Electrical and Electronic Engineering
Computer Networks and Communications
Software
Modelling and Simulation

Access to Document

10.1109/MASCOT.2002.1167076

Cite this

Khonsari, A., Farahani, A., & Ould-Khaoua, M. (2002). Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes. In Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS (Vol. 2002-January, pp. 183-190). Article 1167076 IEEE Computer Society. https://doi.org/10.1109/MASCOT.2002.1167076

Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes. / Khonsari, A.; Farahani, A.; Ould-Khaoua, M.
Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS. Vol. 2002-January IEEE Computer Society, 2002. p. 183-190 1167076.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Khonsari, A, Farahani, A & Ould-Khaoua, M 2002, Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes. in Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS. vol. 2002-January, 1167076, IEEE Computer Society, pp. 183-190, 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002, Fort Worth, United States, 10/11/02. https://doi.org/10.1109/MASCOT.2002.1167076

Khonsari A, Farahani A, Ould-Khaoua M. Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes. In Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS. Vol. 2002-January. IEEE Computer Society. 2002. p. 183-190. 1167076 doi: 10.1109/MASCOT.2002.1167076

@inproceedings{ddd1bc9d868940d1a43e43e31bb0fc7b,

title = "Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes",

abstract = "A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. The paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.",

author = "A. Khonsari and A. Farahani and M. Ould-Khaoua",

year = "2002",

doi = "10.1109/MASCOT.2002.1167076",

language = "English",

isbn = "0769518400",

volume = "2002-January",

pages = "183--190",

booktitle = "Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS",

publisher = "IEEE Computer Society",

note = "10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002 ; Conference date: 11-10-2002 Through 16-10-2002",

}

TY - GEN

T1 - Disha

T2 - 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002

AU - Khonsari, A.

AU - Farahani, A.

AU - Ould-Khaoua, M.

PY - 2002

Y1 - 2002

N2 - A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. The paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

AB - A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. The paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

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

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

U2 - 10.1109/MASCOT.2002.1167076

DO - 10.1109/MASCOT.2002.1167076

M3 - Conference contribution

AN - SCOPUS:84952785882

SN - 0769518400

VL - 2002-January

SP - 183

EP - 190

BT - Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS

PB - IEEE Computer Society

Y2 - 11 October 2002 through 16 October 2002

ER -

Disha: A performance model of a true fully adaptive routing algorithm in k-ary n-cubes

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this