Title :
Performance modelling of a true fully adaptive routing algorithm
Author :
Khonsari, A. ; Sarbazi-Azad, H. ; Ould-Khaoua, M.
Author_Institution :
Dept. of Comput. Sci., Glasgow Univ., UK
Abstract :
Several recent studies have revealed that deadlocks occur very infrequently in the network, especially when enough routing freedom is provided. Routing algorithms based on deadlock avoidance reserve some virtual channels or routing options to specifically deal with deadlocks, and as a result they are not utilized most of the time. Routing algorithms based on deadlock recovery allow messages to use all available virtual channels to cross the network, and efficiently handle infrequently occurred deadlocks. This paper describes a new analytical model of a true fully adaptive routing (TFAR) algorithm with software-based deadlock recovery in k-ary n-cubes. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.
Keywords :
concurrency control; hypercube networks; network routing; performance evaluation; adaptive routing algorithm; deadlock recovery; deadlocks; k-ary n-cubes; message latency; true fully adaptive routing; virtual channels; Analytical models; Bandwidth; Computer networks; Delay; Electronic mail; Employee welfare; Hardware; Predictive models; Routing; System recovery;
Conference_Titel :
Parallel Processing, 2001. International Conference on
Conference_Location :
Valencia, Spain
Print_ISBN :
0-7695-1257-7
DOI :
10.1109/ICPP.2001.952085