On the performance of broadcast algorithms in interconnection networks.

Al-Dubai, Ahmed; Ould-Khaoua, Mohamed

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.

Citation

Al-Dubai, A., & Ould-Khaoua, M. (2005). On the performance of broadcast algorithms in interconnection networks. . https://doi.org/10.1109/ICPPW.2005.63

• Conference Name: Int. Workshop of Performance Evaluation of Networks for Parallel, Cluster and Grid Computing Systems (PEN-PCGCS'05-ICPP),
• Start Date: Jun 14, 2005
• End Date: Jun 17, 2005
• Publication Date: 2005-06
• Deposit Date: Mar 16, 2010
• Peer Reviewed: Peer Reviewed
• Pages: 517-524
• ISBN: 0-7695-2381-1
• DOI: https://doi.org/10.1109/ICPPW.2005.63
• Keywords: Broadcast communication; algorithms; mesh computing; quality of service; scalability; parallelism; coded-path
• Public URL: http://researchrepository.napier.ac.uk/id/eprint/3431
• Publisher URL: http://doi.ieeecomputersociety.org/10.1109/ICPPW.2005.63