Performance modelling of a true fully adaptive routing algorithm

A. Khonsari, H. Sarbazi-Azad, M. Ould-Khaoua

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

2 Citations (Scopus)

Abstract

Several recent studies have revealed that deadlocks occur very infrequently in the network, especially when enough routing freedom is provided. Routing algorithms based on deadlock avoidance reserve some virtual channels or routing options to specifically deal with deadlocks, and as a result they are not utilized most of the time. Routing algorithms based on deadlock recovery allow messages to use all available virtual channels to cross the network, and efficiently handle infrequently occurred deadlocks. This paper describes a new analytical model of a true fully adaptive routing (TFAR) algorithm with software-based deadlock recovery in k-ary n-cubes. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages393-400
Number of pages8
Volume2001-January
ISBN (Print)0769512577
DOIs
Publication statusPublished - 2001
EventInternational Conference on Parallel Processing, ICPP 2001 - Valencia, Spain
Duration: Sep 3 2001Sep 7 2001

Other

OtherInternational Conference on Parallel Processing, ICPP 2001
CountrySpain
CityValencia
Period9/3/019/7/01

Fingerprint

Adaptive Routing
Performance Modeling
Deadlock
Routing algorithms
Routing Algorithm
Adaptive algorithms
Adaptive Algorithm
Virtual Channel
Recovery
Routing
Deadlock Avoidance
K-ary N-cubes
Analytical models
Analytical Model
Simulation Experiment
Latency
Predict
Experiments
Software

Keywords

  • Analytical models
  • Bandwidth
  • Computer networks
  • Delay
  • Electronic mail
  • Employee welfare
  • Hardware
  • Predictive models
  • Routing
  • System recovery

ASJC Scopus subject areas

  • Software
  • Mathematics(all)
  • Hardware and Architecture

Cite this

Khonsari, A., Sarbazi-Azad, H., & Ould-Khaoua, M. (2001). Performance modelling of a true fully adaptive routing algorithm. In Proceedings of the International Conference on Parallel Processing (Vol. 2001-January, pp. 393-400). [952085] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICPP.2001.952085

Performance modelling of a true fully adaptive routing algorithm. / Khonsari, A.; Sarbazi-Azad, H.; Ould-Khaoua, M.

Proceedings of the International Conference on Parallel Processing. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. p. 393-400 952085.

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

Khonsari, A, Sarbazi-Azad, H & Ould-Khaoua, M 2001, Performance modelling of a true fully adaptive routing algorithm. in Proceedings of the International Conference on Parallel Processing. vol. 2001-January, 952085, Institute of Electrical and Electronics Engineers Inc., pp. 393-400, International Conference on Parallel Processing, ICPP 2001, Valencia, Spain, 9/3/01. https://doi.org/10.1109/ICPP.2001.952085
Khonsari A, Sarbazi-Azad H, Ould-Khaoua M. Performance modelling of a true fully adaptive routing algorithm. In Proceedings of the International Conference on Parallel Processing. Vol. 2001-January. Institute of Electrical and Electronics Engineers Inc. 2001. p. 393-400. 952085 https://doi.org/10.1109/ICPP.2001.952085
Khonsari, A. ; Sarbazi-Azad, H. ; Ould-Khaoua, M. / Performance modelling of a true fully adaptive routing algorithm. Proceedings of the International Conference on Parallel Processing. Vol. 2001-January Institute of Electrical and Electronics Engineers Inc., 2001. pp. 393-400
@inproceedings{55ad4fbba42446778adbfc323eb57639,
title = "Performance modelling of a true fully adaptive routing algorithm",
abstract = "Several recent studies have revealed that deadlocks occur very infrequently in the network, especially when enough routing freedom is provided. Routing algorithms based on deadlock avoidance reserve some virtual channels or routing options to specifically deal with deadlocks, and as a result they are not utilized most of the time. Routing algorithms based on deadlock recovery allow messages to use all available virtual channels to cross the network, and efficiently handle infrequently occurred deadlocks. This paper describes a new analytical model of a true fully adaptive routing (TFAR) algorithm with software-based deadlock recovery in k-ary n-cubes. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.",
keywords = "Analytical models, Bandwidth, Computer networks, Delay, Electronic mail, Employee welfare, Hardware, Predictive models, Routing, System recovery",
author = "A. Khonsari and H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2001",
doi = "10.1109/ICPP.2001.952085",
language = "English",
isbn = "0769512577",
volume = "2001-January",
pages = "393--400",
booktitle = "Proceedings of the International Conference on Parallel Processing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Performance modelling of a true fully adaptive routing algorithm

AU - Khonsari, A.

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2001

Y1 - 2001

N2 - Several recent studies have revealed that deadlocks occur very infrequently in the network, especially when enough routing freedom is provided. Routing algorithms based on deadlock avoidance reserve some virtual channels or routing options to specifically deal with deadlocks, and as a result they are not utilized most of the time. Routing algorithms based on deadlock recovery allow messages to use all available virtual channels to cross the network, and efficiently handle infrequently occurred deadlocks. This paper describes a new analytical model of a true fully adaptive routing (TFAR) algorithm with software-based deadlock recovery in k-ary n-cubes. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

AB - Several recent studies have revealed that deadlocks occur very infrequently in the network, especially when enough routing freedom is provided. Routing algorithms based on deadlock avoidance reserve some virtual channels or routing options to specifically deal with deadlocks, and as a result they are not utilized most of the time. Routing algorithms based on deadlock recovery allow messages to use all available virtual channels to cross the network, and efficiently handle infrequently occurred deadlocks. This paper describes a new analytical model of a true fully adaptive routing (TFAR) algorithm with software-based deadlock recovery in k-ary n-cubes. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

KW - Analytical models

KW - Bandwidth

KW - Computer networks

KW - Delay

KW - Electronic mail

KW - Employee welfare

KW - Hardware

KW - Predictive models

KW - Routing

KW - System recovery

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

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

U2 - 10.1109/ICPP.2001.952085

DO - 10.1109/ICPP.2001.952085

M3 - Conference contribution

SN - 0769512577

VL - 2001-January

SP - 393

EP - 400

BT - Proceedings of the International Conference on Parallel Processing

PB - Institute of Electrical and Electronics Engineers Inc.

ER -