A new general method to compute virtual channels occupancy probabilities in wormhole networks

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

Virtual channels have been proposed to develop deadlock free routing algorithms and to overcome the performance degradation due to chains of blocked messages in wormhole switched networks. Hence, capturing the effect of virtual channels has always been an important issue in developing analytical performance models for these interconnection networks. Almost all previous models relayed on a method proposed by Dally to compute the probability of the number of busy virtual channels per physical channel. Dally's method is based on a Markov chain and after extensive investigation our results reveal that its accuracy degrades as traffic increases. In this study we propose and validate a new general method to compute this probability. The new general method is based on an M/G/1 queue and it exhibits a good degree of accuracy at different traffic conditions. We further showed that Dally's method can be deduced as a special case of the general method. Predictions from both, Dally's method and the new general method are validated against results obtained from an event-driven simulator that mimics the behaviour of wormhole-switch networks.

Original languageEnglish
Pages (from-to)1033-1042
Number of pages10
JournalJournal of Computer and System Sciences
Volume74
Issue number6
DOIs
Publication statusPublished - Sep 2008

Fingerprint

Virtual Channel
Wormhole
Switching networks
Routing algorithms
Markov processes
Simulators
Switches
Degradation
Traffic
M/G/1 Queue
Event-driven
Interconnection Networks
Deadlock
Performance Model
Routing Algorithm
Analytical Model
Markov chain
Switch
Simulator
Prediction

Keywords

  • M/G/1 queues
  • Multicomputers
  • Networks
  • Performance modelling
  • Simulation
  • Wormhole switching

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A new general method to compute virtual channels occupancy probabilities in wormhole networks. / Alzeidi, N.; Ould-Khaoua, M.; Khonsari, A.

In: Journal of Computer and System Sciences, Vol. 74, No. 6, 09.2008, p. 1033-1042.

Research output: Contribution to journalArticle

@article{7a7f4081f51b4fe1b5fb82867f63e094,
title = "A new general method to compute virtual channels occupancy probabilities in wormhole networks",
abstract = "Virtual channels have been proposed to develop deadlock free routing algorithms and to overcome the performance degradation due to chains of blocked messages in wormhole switched networks. Hence, capturing the effect of virtual channels has always been an important issue in developing analytical performance models for these interconnection networks. Almost all previous models relayed on a method proposed by Dally to compute the probability of the number of busy virtual channels per physical channel. Dally's method is based on a Markov chain and after extensive investigation our results reveal that its accuracy degrades as traffic increases. In this study we propose and validate a new general method to compute this probability. The new general method is based on an M/G/1 queue and it exhibits a good degree of accuracy at different traffic conditions. We further showed that Dally's method can be deduced as a special case of the general method. Predictions from both, Dally's method and the new general method are validated against results obtained from an event-driven simulator that mimics the behaviour of wormhole-switch networks.",
keywords = "M/G/1 queues, Multicomputers, Networks, Performance modelling, Simulation, Wormhole switching",
author = "N. Alzeidi and M. Ould-Khaoua and A. Khonsari",
year = "2008",
month = "9",
doi = "10.1016/j.jcss.2007.07.006",
language = "English",
volume = "74",
pages = "1033--1042",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "6",

}

TY - JOUR

T1 - A new general method to compute virtual channels occupancy probabilities in wormhole networks

AU - Alzeidi, N.

AU - Ould-Khaoua, M.

AU - Khonsari, A.

PY - 2008/9

Y1 - 2008/9

N2 - Virtual channels have been proposed to develop deadlock free routing algorithms and to overcome the performance degradation due to chains of blocked messages in wormhole switched networks. Hence, capturing the effect of virtual channels has always been an important issue in developing analytical performance models for these interconnection networks. Almost all previous models relayed on a method proposed by Dally to compute the probability of the number of busy virtual channels per physical channel. Dally's method is based on a Markov chain and after extensive investigation our results reveal that its accuracy degrades as traffic increases. In this study we propose and validate a new general method to compute this probability. The new general method is based on an M/G/1 queue and it exhibits a good degree of accuracy at different traffic conditions. We further showed that Dally's method can be deduced as a special case of the general method. Predictions from both, Dally's method and the new general method are validated against results obtained from an event-driven simulator that mimics the behaviour of wormhole-switch networks.

AB - Virtual channels have been proposed to develop deadlock free routing algorithms and to overcome the performance degradation due to chains of blocked messages in wormhole switched networks. Hence, capturing the effect of virtual channels has always been an important issue in developing analytical performance models for these interconnection networks. Almost all previous models relayed on a method proposed by Dally to compute the probability of the number of busy virtual channels per physical channel. Dally's method is based on a Markov chain and after extensive investigation our results reveal that its accuracy degrades as traffic increases. In this study we propose and validate a new general method to compute this probability. The new general method is based on an M/G/1 queue and it exhibits a good degree of accuracy at different traffic conditions. We further showed that Dally's method can be deduced as a special case of the general method. Predictions from both, Dally's method and the new general method are validated against results obtained from an event-driven simulator that mimics the behaviour of wormhole-switch networks.

KW - M/G/1 queues

KW - Multicomputers

KW - Networks

KW - Performance modelling

KW - Simulation

KW - Wormhole switching

UR - http://www.scopus.com/inward/record.url?scp=47849096402&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=47849096402&partnerID=8YFLogxK

U2 - 10.1016/j.jcss.2007.07.006

DO - 10.1016/j.jcss.2007.07.006

M3 - Article

AN - SCOPUS:47849096402

VL - 74

SP - 1033

EP - 1042

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 6

ER -