A queueing model for predicting message latency in uni-directional k-ary n-cubes with deterministic routing and non-uniform traffic

  • Authors:

  • Samia Loucif;Mohamed Ould Khaoua;Geyong Min

  • Affiliations:

  • Department of Computing Science, University of Glasgow, Glasgow, UK G12 8RZ;Department of Electrical & Computer Engineering, Sultan Qaboos University, Al-Khod, Oman PC 123;Department of Computing, University of Bradford, Bradford, UK BD7 1DP

  • Venue:
  • Cluster Computing
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

The interconnection network is one of the key architectural components in any parallel computer. The distribution of the traffic injected into the network is among the factors that greatly influences network performance. The uniform traffic pattern has been adopted in many existing network performance evaluation studies due to the tractability of the resulting analytical modelling approach. However, many real applications exhibit non-uniform traffic patterns such as hot-spot traffic. K-ary n-cubes have been the mostly widely used in the implementation of practical parallel systems. Extensive research studies have been conducted on the performance modelling and evaluation of these networks. Nonetheless, most of these studies have been confined to uniform traffic distributions and have been based on software simulation. The present paper proposes a new stochastic model to predict message latency in k-ary n-cubes with deterministic routing in the presence of hot-spot traffic. The model has been validated through simulation experiments and has shown a close agreement with simulation results.