A performance model of compressionless routing in k-ary n-cube networks

  • Authors:

  • A. Khonsari;M. Ould-Khaoua

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Tehran, Iran and Institute for Studies in Theoretical Physics and Mathematics (I.P.M.), Iran;Department of Computing Science, University of Glasgow, Glasgow, UK

  • Venue:
  • Performance Evaluation
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several analytical models of fully adaptive routing in wormhole-routed networks have recently been reported in the literature. All these models, however, have been discussed for routing algorithms with deadlock avoidance. Recent studies have revealed that deadlocks are quite rare in the network, especially when enough routing freedom is provided. Thus, the hardware resources, e,g. virtual channels, dedicated for deadlock avoidance are not utilised most of the time. This consideration has motivated researchers to introduce fully adaptive routing algorithms with deadlock-recovery. This paper proposes a new analytical model to predict message latency in k-aryn-cubes with compressionless routing, a fully adaptive algorithm that uses deadlock-recovery. The proposed model uses results from queueing systems with impatient customers to capture the effects of the timeout mechanism used in this routing algorithm to deal with message deadlock. The validity of the model is demonstrated by comparing results predicted by the analytical model against those obtained through simulation experiments.