Al-Dubai, Ahmed, Ould-Khaoua, Mohamed and Mackenzie, Lewis (2002) Towards a scalable broadcast in wormhole-routed mesh networks. In: Proceedings of the 2002 ACM symposium on Applied computing. ACM, New York, USA, pp. 840-844. ISBN 1-58113-445-2

PDF Restricted to Registered users only Available under License Creative Commons Attribution Non-commercial. Download (430kB) | Request a copy

Abstract/Description

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) [I]. 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.

Actions (login required)