BNR: the tool to analyze and design the minimal deadlock free fully adaptive routing algorithm

2000 ◽  
Author(s):  
Bo Deng ◽  
Hu Xu ◽  
Xiaodong Yang
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Fully Adaptive

A Performance Model of Software-Based Deadlock Recovery Routing Algorithm in Hypercubes

2005 ◽  
Vol 15 (01n02) ◽  
pp. 153-168 ◽  
Author(s):  
A. KHONSARI ◽  
H. SARBAZI-AZAD ◽  
M. OULD-KHAOUA
Keyword(s):  
Routing Algorithm ◽  
Queueing Systems ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Performance Model ◽  
Deadlock Detection ◽  
Impatient Customers ◽  
Simulation Experiments ◽  
Proposed Model ◽  
Fully Adaptive

Recent studies have revealed that deadlocks are generally infrequent in the network. Thus the hardware resources, e.g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated the development of novel adaptive routing algorithms with deadlock recovery. This paper describes a new analytical model to predict message latency in hypercubes with a true fully adaptive routing algorithm with progressive deadlock recovery. One of the main features of the proposed model is the use of results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm for deadlock detection. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.

Sign in / Sign up

Export Citation Format

Share Document