On the probability distribution of busy virtual channels

  • Authors:
  • N. Alzeidi;A. Khonsari;M. Ould-Khaoua;L. M. Mackenzie

  • Affiliations:
  • University of Glasgow, Computing Science Department, Glasgow, UK;University of Tehran, Dept. of ECE, Tehran, Iran and IPM, School of Computer Science, Tehran, Iran;University of Glasgow, Computing Science Department, Glasgow, UK;University of Glasgow, Computing Science Department, Glasgow, UK

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A major issue in modelling the performance merits of interconnection network is dealing with virtual channels. Some analytical models chose not to deal with this issue at all i.e. one virtual channel per physical channel. More sophisticated models, however, relayed on a method proposed by Dally to capture the effect of arranging the physical channel into many virtual channels. In this study, we investigate the accuracy of Dally's method and propose an alternative approach to deal with virtual channels in analytical performance modelling. The new method is validated via simulation experiments and results reveal its accuracy under different traffic conditions.