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 language | English |
|---|---|
| Pages (from-to) | 97-106 |
| Number of pages | 10 |
| Journal | IEE Proceedings: Computers and Digital Techniques |
| Volume | 150 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - Mar 2003 |
Fingerprint
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 journal › Article
}
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 -