TY - GEN
T1 - Disha
T2 - 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002
AU - Khonsari, A.
AU - Farahani, A.
AU - Ould-Khaoua, M.
N1 - Publisher Copyright:
© 2002 IEEE.
PY - 2002
Y1 - 2002
N2 - 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. 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 (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) 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. The 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.
AB - 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. 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 (see Anjan, K.V. and Pinkston, T.M., Proc. 22nd ACM/IEEE Int. Symp. on Computer Architecture, p.201-10, 1996; Pinkston, T.M., IEEE Trans. Computers, vol.7, no.48, p.649-69, 1999) 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. The 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.
UR - http://www.scopus.com/inward/record.url?scp=84952785882&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84952785882&partnerID=8YFLogxK
U2 - 10.1109/MASCOT.2002.1167076
DO - 10.1109/MASCOT.2002.1167076
M3 - Conference contribution
AN - SCOPUS:84952785882
T3 - Proceedings - IEEE Computer Society's Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS
SP - 183
EP - 190
BT - Proceedings - 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems, MASCOTS 2002
A2 - Boukerche, A.
A2 - Majumdar, S.
A2 - Das, S.K.
PB - IEEE Computer Society
Y2 - 11 October 2002 through 16 October 2002
ER -