On the performance of broadcast algorithms in interconnection networks

Ahmed Yassin Al-Dubai*, Mohamed Ould-Khaoua

*Corresponding author for this work

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
Country/TerritoryNorway
CityOslo
Period6/14/056/17/05

ASJC Scopus subject areas

  • General Engineering

Fingerprint

Dive into the research topics of 'On the performance of broadcast algorithms in interconnection networks'. Together they form a unique fingerprint.

Cite this