Research Output

A scalable plane-based broadcast algorithm for 3D-mesh networks

  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 efficient broadcast algorithm for the mesh. The
main feature of the proposed algorithm lies in its ability
to perform broadcast operation with a high degree of
scalability and parallelism. Furthermore, its performance
is insensitive to the network size, i.e., only three
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.

  • Date:

    30 November 2002

  • Publication Status:

    Published

  • Publisher

    IEEE Computer Society Press

  • DOI:

    10.1109/EMPDP.2003.1183581

  • Library of Congress:

    QA75 Electronic computers. Computer science

Citation

Al-Dubai, A., Ould-Khaoua, M. & Mackenzie, L. (2002). A scalable plane-based broadcast algorithm for 3D-mesh networks. In Proceedings of the Eleventh Euromicro Conference on Parallel,Distributed and Network-Based Processing (Euro-PDP’03), 149-156. doi:10.1109/EMPDP.2003.1183581. ISBN 0-7695-1875-3

Authors

Keywords

distributed memory systems; message passing; multiprocessor interconnection networks; network routing; parallel algorithms; parallel programming; performance evaluation; 3D-mesh networks; distributed memory systems; message-passing steps; parallel applications; performance scalable plane-based broadcast algorithm; wormhole-switched meshes;

Available Documents