Analytical modelling of broadcast in adaptive wormhole-routed hypercubes

A. Shahrabi, M. Ould-Khaoua, L. M. Mackenzie

Research output: Contribution to journalArticle

Abstract

Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) communication. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the hypercube. The broadcast algorithm considered in this study is based on the unicast-based approach and described [IEEE Trans. Parallel Distrib. Syst. 5 (1994) 1252]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

Original languageEnglish
Pages (from-to)389-398
Number of pages10
JournalMicroprocessors and Microsystems
Volume25
Issue number8
DOIs
Publication statusPublished - Nov 10 2001

Fingerprint

Analytical models
Communication
Experiments

Keywords

  • Adaptive routing
  • Interconnection networks
  • Multicomputers
  • Performance modelling
  • Wormhole routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Analytical modelling of broadcast in adaptive wormhole-routed hypercubes. / Shahrabi, A.; Ould-Khaoua, M.; Mackenzie, L. M.

In: Microprocessors and Microsystems, Vol. 25, No. 8, 10.11.2001, p. 389-398.

Research output: Contribution to journalArticle

@article{06e7966290f84bdf9e340e17862503d2,
title = "Analytical modelling of broadcast in adaptive wormhole-routed hypercubes",
abstract = "Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) communication. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the hypercube. The broadcast algorithm considered in this study is based on the unicast-based approach and described [IEEE Trans. Parallel Distrib. Syst. 5 (1994) 1252]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.",
keywords = "Adaptive routing, Interconnection networks, Multicomputers, Performance modelling, Wormhole routing",
author = "A. Shahrabi and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2001",
month = "11",
day = "10",
doi = "10.1016/S0141-9331(01)00135-1",
language = "English",
volume = "25",
pages = "389--398",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "8",

}

TY - JOUR

T1 - Analytical modelling of broadcast in adaptive wormhole-routed hypercubes

AU - Shahrabi, A.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2001/11/10

Y1 - 2001/11/10

N2 - Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) communication. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the hypercube. The broadcast algorithm considered in this study is based on the unicast-based approach and described [IEEE Trans. Parallel Distrib. Syst. 5 (1994) 1252]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

AB - Many analytical models of wormhole-routed networks have been proposed over the past few years. Most of these models, however, have been developed for unicast (or point-to-point) communication. There has been comparatively little activity in the area of analytical models of collective communication, such as broadcast. As a result, most existing studies have relied on simulation to evaluate the performance merits of collective communication algorithms. This paper presents a new analytical model for predicting broadcast latency in the hypercube. The broadcast algorithm considered in this study is based on the unicast-based approach and described [IEEE Trans. Parallel Distrib. Syst. 5 (1994) 1252]. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting message latency under different working conditions.

KW - Adaptive routing

KW - Interconnection networks

KW - Multicomputers

KW - Performance modelling

KW - Wormhole routing

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

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

U2 - 10.1016/S0141-9331(01)00135-1

DO - 10.1016/S0141-9331(01)00135-1

M3 - Article

VL - 25

SP - 389

EP - 398

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 8

ER -