Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks

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

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most existing network evaluation studies have been based on software simulation, the present study is the first to use the analytical modelling approach to conduct the comparative analysis. The results reveal that in most cases deadlock recovery routing algorithms exhibit superior performance characteristics over their deadlock avoidance counterparts.

Original languageEnglish
Pages (from-to)97-106
Number of pages10
JournalIEE Proceedings: Computers and Digital Techniques
Volume150
Issue number2
DOIs
Publication statusPublished - Mar 2003

Fingerprint

Deadlock Avoidance
Wormhole
Switching networks
Deadlock
Performance Comparison
Routing algorithms
Routing Algorithm
Recovery
Adaptive Routing
Adaptive algorithms
Adaptive Algorithm
Analytical Modeling
Simulation Software
Comparative Analysis
Routing
Resources
Evaluation

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Hardware and Architecture
  • Theoretical Computer Science

Cite this

Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks. / Khonsari, A.; Shahrabi, A.; Ould-Khaoua, M.; Sarbazi-Azad, H.

In: IEE Proceedings: Computers and Digital Techniques, Vol. 150, No. 2, 03.2003, p. 97-106.

Research output: Contribution to journalArticle

@article{6705057307a748f59333baa9a5237b94,
title = "Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks",
abstract = "Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most existing network evaluation studies have been based on software simulation, the present study is the first to use the analytical modelling approach to conduct the comparative analysis. The results reveal that in most cases deadlock recovery routing algorithms exhibit superior performance characteristics over their deadlock avoidance counterparts.",
author = "A. Khonsari and A. Shahrabi and M. Ould-Khaoua and H. Sarbazi-Azad",
year = "2003",
month = "3",
doi = "10.1049/ip-cdt:20030279",
language = "English",
volume = "150",
pages = "97--106",
journal = "IEE Proceedings: Computers and Digital Techniques",
issn = "1350-2387",
publisher = "Institute of Electrical Engineers",
number = "2",

}

TY - JOUR

T1 - Performance comparison of deadlock recovery and deadlock avoidance routing algorithms in wormhole-switched networks

AU - Khonsari, A.

AU - Shahrabi, A.

AU - Ould-Khaoua, M.

AU - Sarbazi-Azad, H.

PY - 2003/3

Y1 - 2003/3

N2 - Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most existing network evaluation studies have been based on software simulation, the present study is the first to use the analytical modelling approach to conduct the comparative analysis. The results reveal that in most cases deadlock recovery routing algorithms exhibit superior performance characteristics over their deadlock avoidance counterparts.

AB - Dealing with deadlock has always been a crucial issue for any routing algorithms proposed for wormhole-switched networks. Adaptive routing algorithms, based on deadlock avoidance strategies, usually dedicate resources specifically to ensure deadlock freedom. However, a number of recent studies have demonstrated that deadlocks are quite rare in the network. This fact has motivated researchers to introduce adaptive routing algorithms based on deadlock recovery strategies. In an effort to gain a deep understanding of the factors that affect routing performance, a comparison of the performance merits of deadlock recovery against deadlock avoidance routing algorithms is performed. While most existing network evaluation studies have been based on software simulation, the present study is the first to use the analytical modelling approach to conduct the comparative analysis. The results reveal that in most cases deadlock recovery routing algorithms exhibit superior performance characteristics over their deadlock avoidance counterparts.

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

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

U2 - 10.1049/ip-cdt:20030279

DO - 10.1049/ip-cdt:20030279

M3 - Article

AN - SCOPUS:0038639144

VL - 150

SP - 97

EP - 106

JO - IEE Proceedings: Computers and Digital Techniques

JF - IEE Proceedings: Computers and Digital Techniques

SN - 1350-2387

IS - 2

ER -