A plane-based broadcast algorithm for multicomputer networks

A. Al-Dubai, M. Ould-Khaoua, L. MacKenzie

Research output: Contribution to journalArticle

Abstract

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.

Original languageEnglish
Pages (from-to)617-632
Number of pages16
JournalJournal of Systems Architecture
Volume51
Issue number10-11
DOIs
Publication statusPublished - Oct 2005

    Fingerprint

Keywords

  • Collective communication
  • Mesh
  • Multicomputer
  • Performance analysis
  • Turn model
  • Wormhole switching

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this