Towards a scalable broadcast in wormhole-switched mesh networks

A. Y. Al-Dubai*, M. Ould-Khaoua, L. M. Mackenzie

*Corresponding author for this work

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

1 Citation (Scopus)


Broadcast algorithms for wormhole-switched meshes have been widely reported in the literature. However, most of these algorithms handle broadcast in a sequential manner and do not scale well with the network size. As a consequence, many parallel applications cannot be efficiently supported using existing algorithms. Motivated by these observations, this paper presents a new broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two message-passing steps are required to implement a broadcast operation irrespective of the network size. Results from a comparative analysis reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.

Original languageEnglish
Title of host publicationProceedings of the ACM Symposium on Applied Computing
Number of pages5
Publication statusPublished - 2002
EventApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain
Duration: Mar 11 2002Mar 14 2002


OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing


  • Collective communication
  • Communication Latency
  • Interconnection networks
  • Routing
  • Wormhole switching

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Towards a scalable broadcast in wormhole-switched mesh networks'. Together they form a unique fingerprint.

Cite this