Research Output
A plane-based broadcast algorithm for multicomputer networks
  Maximising the performance of parallel systems requires matching message-passing algorithms and application characteristics with a suitable underling interconnection network. 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 techniques. Motivated by these observations, this paper presents a new efficient broadcast algorithm for the mesh, called the Plane-Based (PB) algorithm. The main feature of this approach is its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, 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 demonstrate that the PB algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.


Al-Dubai, A., Ould-Khaoua, M., & Mackenzie, L. (2005). A plane-based broadcast algorithm for multicomputer networks. Journal of Systems Architecture, 51(10-11), 617-632.



Computing; Parallel systems; Performance enhancement; Broadcast algorithms; Worm-hole switching; Plane based algorithm; Evaluation;

Monthly Views:

Available Documents