A performance model for Duato's fully adaptive routing algorithm in k-ary n-cubes

1999 ◽  
Vol 48 (12) ◽  
pp. 1297-1304 ◽  
Author(s):  
M. Ould-Khaoua
Keyword(s):  
Routing Algorithm ◽  
Adaptive Routing ◽  
Performance Model ◽  
Fully Adaptive ◽  
A Performance

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.

A PERFORMANCE MODEL OF DISHA ROUTING IN K-ARY N-CUBE NETWORKS

2007 ◽  
Vol 17 (02) ◽  
pp. 213-228 ◽  
Author(s):  
A. KHONSARI ◽  
A. SHAHRABI ◽  
M. OULD-KHAOUA
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Performance Model ◽  
Analytical Models ◽  
Traffic Conditions ◽  
Proposed Model ◽  
Fully Adaptive ◽  
Wormhole Routed

A number of analytical models for predicting message latency in k-ary n-cubes have recently been reported in the literature. Most of these models, however, have been discussed for adaptive routing algorithms based on deadlock avoidance, e.g. Duato's routing. Several research studies have empirically demonstrated that routing algorithms based on deadlock recovery offer maximal adaptivity that can result in considerable improvement in network performance. Disha is an example of a true fully adaptive routing algorithm that uses minimal hardware to implement a simple and efficient progressive method to recover from potential deadlocks. This paper proposes a new analytical model of Disha in wormhole-routed k-ary n-cubes. Simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various networks sizes and under different traffic conditions.

Sign in / Sign up

Export Citation Format

Share Document