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

Message passing
Scalability

Keywords

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

ASJC Scopus subject areas

  • Hardware and Architecture
  • Software

Cite this

A plane-based broadcast algorithm for multicomputer networks. / Al-Dubai, A.; Ould-Khaoua, M.; MacKenzie, L.

In: Journal of Systems Architecture, Vol. 51, No. 10-11, 10.2005, p. 617-632.

Research output: Contribution to journalArticle

Al-Dubai, A. ; Ould-Khaoua, M. ; MacKenzie, L. / A plane-based broadcast algorithm for multicomputer networks. In: Journal of Systems Architecture. 2005 ; Vol. 51, No. 10-11. pp. 617-632.
@article{8efb3a2b81ef4e08acbed85d47fb8a48,
title = "A plane-based broadcast algorithm for multicomputer networks",
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.",
keywords = "Collective communication, Mesh, Multicomputer, Performance analysis, Turn model, Wormhole switching",
author = "A. Al-Dubai and M. Ould-Khaoua and L. MacKenzie",
year = "2005",
month = "10",
doi = "10.1016/j.sysarc.2005.01.003",
language = "English",
volume = "51",
pages = "617--632",
journal = "Journal of Systems Architecture",
issn = "1383-7621",
publisher = "Elsevier",
number = "10-11",

}

TY - JOUR

T1 - A plane-based broadcast algorithm for multicomputer networks

AU - Al-Dubai, A.

AU - Ould-Khaoua, M.

AU - MacKenzie, L.

PY - 2005/10

Y1 - 2005/10

N2 - 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.

AB - 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.

KW - Collective communication

KW - Mesh

KW - Multicomputer

KW - Performance analysis

KW - Turn model

KW - Wormhole switching

UR - http://www.scopus.com/inward/record.url?scp=25644459290&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=25644459290&partnerID=8YFLogxK

U2 - 10.1016/j.sysarc.2005.01.003

DO - 10.1016/j.sysarc.2005.01.003

M3 - Article

AN - SCOPUS:25644459290

VL - 51

SP - 617

EP - 632

JO - Journal of Systems Architecture

JF - Journal of Systems Architecture

SN - 1383-7621

IS - 10-11

ER -