Analysis of true fully adaptive routing with software-based deadlock recovery

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

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

Several analytical models of fully adaptive routing (AR) in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model of a true fully AR algorithm with software-based deadlock recovery, proposed in Martinez et al. (Software-based deadlock recovery techniques for true fully AR in wormhole networks, Proc. Int. Conf. Parallel Processing (ICPP'97), 1997, p. 182) for k-ary n-cubes. The proposed model uses the results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

Original languageEnglish
Pages (from-to)259-270
Number of pages12
JournalThe Journal of Systems and Software
Volume71
Issue number3
DOIs
Publication statusPublished - May 2004

Fingerprint

Routing algorithms
Recovery
Adaptive algorithms
Analytical models
Hardware
Processing
Experiments

Keywords

  • Interconnection networks
  • k-ary n-cube
  • Message latency
  • Multicomputers
  • Parallel architectures
  • Performance analysis
  • Performance modelling
  • Routing algorithm

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Analysis of true fully adaptive routing with software-based deadlock recovery. / Khonsari, A.; Sarbazi-Azad, H.; Ould-Khaoua, M.

In: The Journal of Systems and Software, Vol. 71, No. 3, 05.2004, p. 259-270.

Research output: Contribution to journalArticle

@article{5e400c5bfdeb4b4a8dc019288b9196b1,
title = "Analysis of true fully adaptive routing with software-based deadlock recovery",
abstract = "Several analytical models of fully adaptive routing (AR) in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model of a true fully AR algorithm with software-based deadlock recovery, proposed in Martinez et al. (Software-based deadlock recovery techniques for true fully AR in wormhole networks, Proc. Int. Conf. Parallel Processing (ICPP'97), 1997, p. 182) for k-ary n-cubes. The proposed model uses the results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.",
keywords = "Interconnection networks, k-ary n-cube, Message latency, Multicomputers, Parallel architectures, Performance analysis, Performance modelling, Routing algorithm",
author = "A. Khonsari and H. Sarbazi-Azad and M. Ould-Khaoua",
year = "2004",
month = "5",
doi = "10.1016/S0164-1212(03)00008-6",
language = "English",
volume = "71",
pages = "259--270",
journal = "Journal of Systems and Software",
issn = "0164-1212",
publisher = "Elsevier Inc.",
number = "3",

}

TY - JOUR

T1 - Analysis of true fully adaptive routing with software-based deadlock recovery

AU - Khonsari, A.

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2004/5

Y1 - 2004/5

N2 - Several analytical models of fully adaptive routing (AR) in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model of a true fully AR algorithm with software-based deadlock recovery, proposed in Martinez et al. (Software-based deadlock recovery techniques for true fully AR in wormhole networks, Proc. Int. Conf. Parallel Processing (ICPP'97), 1997, p. 182) for k-ary n-cubes. The proposed model uses the results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

AB - Several analytical models of fully adaptive routing (AR) in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model of a true fully AR algorithm with software-based deadlock recovery, proposed in Martinez et al. (Software-based deadlock recovery techniques for true fully AR in wormhole networks, Proc. Int. Conf. Parallel Processing (ICPP'97), 1997, p. 182) for k-ary n-cubes. The proposed model uses the results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.

KW - Interconnection networks

KW - k-ary n-cube

KW - Message latency

KW - Multicomputers

KW - Parallel architectures

KW - Performance analysis

KW - Performance modelling

KW - Routing algorithm

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

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

U2 - 10.1016/S0164-1212(03)00008-6

DO - 10.1016/S0164-1212(03)00008-6

M3 - Article

AN - SCOPUS:1242332485

VL - 71

SP - 259

EP - 270

JO - Journal of Systems and Software

JF - Journal of Systems and Software

SN - 0164-1212

IS - 3

ER -