Skip to main content

Research Repository

Advanced Search

Towards optimal broadcasting in wormhole-routed meshes

Al-Dubai, Ahmed; Ould-Khaoua, Mohamed; Mackenzie, Lewis

Authors

Mohamed Ould-Khaoua

Lewis Mackenzie



Contributors

Hamid R Arabnia
Editor

Abstract

Most existing broadcast algorithms proposed for the mesh do not scale well with the network size. Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative paths provided by mesh topology to reduce communication latency. Motivated by these observations, this paper introduces a new adaptive broadcast algorithm for the mesh based on the coded path routing approach. The unique feature of the new algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. Results from a comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node and Network Partitioning algorithms.

Citation

Al-Dubai, A., Ould-Khaoua, M., & Mackenzie, L. (2001, June). Towards optimal broadcasting in wormhole-routed meshes. Presented at PDPTA '2001

Conference Name PDPTA '2001
Start Date Jun 25, 2001
End Date Jun 28, 2001
Publication Date 2001
Deposit Date Dec 4, 2009
Peer Reviewed Peer Reviewed
Pages 1121-1128
Book Title Proceedings of the international conference on parallel and distributed processing techniques and applications : PDPTA'2001.
Chapter Number Vol 3
ISBN 1892512696
Keywords Mesh; Broadcast; Wormhole Switching; Adaptive Routing; Communication Latency; Performance Analysis;
Public URL http://researchrepository.napier.ac.uk/id/eprint/3570