On the performance of broadcast algorithms in interconnection networks

Al-Dubai, A.Y. and Ould-Khaoua, M. (2005) On the performance of broadcast algorithms in interconnection networks. In: International Conference on Parallel Processing Workshops 2005 (ICPP 2005 Workshops), Oslo, Norway, 14-17 June 2005, pp. 517-524. (doi: 10.1109/ICPPW.2005.63)

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.

• Item Type: Conference Proceedings
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Ould-Khaoua, Dr Mohamed
• Authors: Al-Dubai, A.Y., and Ould-Khaoua, M.
• Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
• College/School: College of Science and Engineering > School of Computing Science
• Publisher: IEEE Computer Society
• ISSN: 1530-2016
• Copyright Holders: Copyright © 2005 IEEE
• First Published: First published in International Conference on Parallel Processing Workshops 2005 (ICPP 2005 Workshops)
• Publisher Policy: Reproduced in accordance with the copyright policy of the publisher.