On the performance of broadcast algorithms in interconnection networks

Ahmed Yassin Al-Dubai, Mohamed Ould-Khaoua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Broadcast Communication is among the most primitive collective capabilities of any message passing network. Broadcast algorithms for the mesh have been widely reported in the literature. However, most existing algorithms have been studied within limited conditions, such as light traffic load and fixed network sizes. In other words, most of these algorithms have not been studied at different Quality of Service (QoS) levels. In contrast, this study examines the broadcast operation, taking into account the scalability, parallelism, a wide range of traffic loads through the propagation of broadcast messages. To the best of our knowledge, this study is the first to consider the issue of broadcast latency at both the network and node levels across different traffic loads. Results are shown from a comparative analysis confirming that the coded-path based broadcast algorithms exhibit superior performance characteristics over some existing algorithms.

Original languageEnglish
Title of host publicationProceedings of the International Conference on Parallel Processing Workshops
Pages517-524
Number of pages8
Volume2005
DOIs
Publication statusPublished - 2005
EventInternational Conference on Parallel Processing Workshops 2005, ICPP 2005 - Oslo, Norway
Duration: Jun 14 2005Jun 17 2005

Other

OtherInternational Conference on Parallel Processing Workshops 2005, ICPP 2005
CountryNorway
CityOslo
Period6/14/056/17/05

Fingerprint

Message passing
Scalability
Quality of service
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Al-Dubai, A. Y., & Ould-Khaoua, M. (2005). On the performance of broadcast algorithms in interconnection networks. In Proceedings of the International Conference on Parallel Processing Workshops (Vol. 2005, pp. 517-524). [1488737] https://doi.org/10.1109/ICPPW.2005.63

On the performance of broadcast algorithms in interconnection networks. / Al-Dubai, Ahmed Yassin; Ould-Khaoua, Mohamed.

Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2005 2005. p. 517-524 1488737.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Al-Dubai, AY & Ould-Khaoua, M 2005, On the performance of broadcast algorithms in interconnection networks. in Proceedings of the International Conference on Parallel Processing Workshops. vol. 2005, 1488737, pp. 517-524, International Conference on Parallel Processing Workshops 2005, ICPP 2005, Oslo, Norway, 6/14/05. https://doi.org/10.1109/ICPPW.2005.63
Al-Dubai AY, Ould-Khaoua M. On the performance of broadcast algorithms in interconnection networks. In Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2005. 2005. p. 517-524. 1488737 https://doi.org/10.1109/ICPPW.2005.63
Al-Dubai, Ahmed Yassin ; Ould-Khaoua, Mohamed. / On the performance of broadcast algorithms in interconnection networks. Proceedings of the International Conference on Parallel Processing Workshops. Vol. 2005 2005. pp. 517-524
@inproceedings{84119635aff94e8da65edbb5abc5b5b9,
title = "On the performance of broadcast algorithms in interconnection networks",
abstract = "Broadcast Communication is among the most primitive collective capabilities of any message passing network. Broadcast algorithms for the mesh have been widely reported in the literature. However, most existing algorithms have been studied within limited conditions, such as light traffic load and fixed network sizes. In other words, most of these algorithms have not been studied at different Quality of Service (QoS) levels. In contrast, this study examines the broadcast operation, taking into account the scalability, parallelism, a wide range of traffic loads through the propagation of broadcast messages. To the best of our knowledge, this study is the first to consider the issue of broadcast latency at both the network and node levels across different traffic loads. Results are shown from a comparative analysis confirming that the coded-path based broadcast algorithms exhibit superior performance characteristics over some existing algorithms.",
author = "Al-Dubai, {Ahmed Yassin} and Mohamed Ould-Khaoua",
year = "2005",
doi = "10.1109/ICPPW.2005.63",
language = "English",
volume = "2005",
pages = "517--524",
booktitle = "Proceedings of the International Conference on Parallel Processing Workshops",

}

TY - GEN

T1 - On the performance of broadcast algorithms in interconnection networks

AU - Al-Dubai, Ahmed Yassin

AU - Ould-Khaoua, Mohamed

PY - 2005

Y1 - 2005

N2 - Broadcast Communication is among the most primitive collective capabilities of any message passing network. Broadcast algorithms for the mesh have been widely reported in the literature. However, most existing algorithms have been studied within limited conditions, such as light traffic load and fixed network sizes. In other words, most of these algorithms have not been studied at different Quality of Service (QoS) levels. In contrast, this study examines the broadcast operation, taking into account the scalability, parallelism, a wide range of traffic loads through the propagation of broadcast messages. To the best of our knowledge, this study is the first to consider the issue of broadcast latency at both the network and node levels across different traffic loads. Results are shown from a comparative analysis confirming that the coded-path based broadcast algorithms exhibit superior performance characteristics over some existing algorithms.

AB - Broadcast Communication is among the most primitive collective capabilities of any message passing network. Broadcast algorithms for the mesh have been widely reported in the literature. However, most existing algorithms have been studied within limited conditions, such as light traffic load and fixed network sizes. In other words, most of these algorithms have not been studied at different Quality of Service (QoS) levels. In contrast, this study examines the broadcast operation, taking into account the scalability, parallelism, a wide range of traffic loads through the propagation of broadcast messages. To the best of our knowledge, this study is the first to consider the issue of broadcast latency at both the network and node levels across different traffic loads. Results are shown from a comparative analysis confirming that the coded-path based broadcast algorithms exhibit superior performance characteristics over some existing algorithms.

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

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

U2 - 10.1109/ICPPW.2005.63

DO - 10.1109/ICPPW.2005.63

M3 - Conference contribution

AN - SCOPUS:33745185119

VL - 2005

SP - 517

EP - 524

BT - Proceedings of the International Conference on Parallel Processing Workshops

ER -