A new scalable broadcast algorithm for multiport meshes with minimum communication steps

Ahmed Y. Al-Dubai, Mohamed Ould-Khaoua

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Many broadcast algorithms have been proposed for the mesh in the literature. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by this observation, this paper makes two contributions. Firstly, in an effort to minimise the effects of network size on communication performance, this study proposes a new routing approach that enables the development of efficient broadcast algorithms that can maintain good performance levels for various mesh sizes. Secondly, based on the new routing approach, we propose a new adaptive broadcast algorithm for the mesh. The main feature of the proposed algorithm is its ability to handle broadcast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

Original languageEnglish
Pages (from-to)101-113
Number of pages13
JournalMicroprocessors and Microsystems
Volume27
Issue number3
DOIs
Publication statusPublished - Apr 25 2003

Fingerprint

Communication
Message passing
Adaptive algorithms
Scalability
Large scale systems

Keywords

  • Collective communication
  • Interconnection networks
  • Performance analysis
  • Wormhole routing

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

A new scalable broadcast algorithm for multiport meshes with minimum communication steps. / Al-Dubai, Ahmed Y.; Ould-Khaoua, Mohamed.

In: Microprocessors and Microsystems, Vol. 27, No. 3, 25.04.2003, p. 101-113.

Research output: Contribution to journalArticle

@article{29b16094ecfb45888a07ca7f2dc486f9,
title = "A new scalable broadcast algorithm for multiport meshes with minimum communication steps",
abstract = "Many broadcast algorithms have been proposed for the mesh in the literature. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by this observation, this paper makes two contributions. Firstly, in an effort to minimise the effects of network size on communication performance, this study proposes a new routing approach that enables the development of efficient broadcast algorithms that can maintain good performance levels for various mesh sizes. Secondly, based on the new routing approach, we propose a new adaptive broadcast algorithm for the mesh. The main feature of the proposed algorithm is its ability to handle broadcast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.",
keywords = "Collective communication, Interconnection networks, Performance analysis, Wormhole routing",
author = "Al-Dubai, {Ahmed Y.} and Mohamed Ould-Khaoua",
year = "2003",
month = "4",
day = "25",
doi = "10.1016/S0141-9331(02)00094-7",
language = "English",
volume = "27",
pages = "101--113",
journal = "Microprocessors and Microsystems",
issn = "0141-9331",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - A new scalable broadcast algorithm for multiport meshes with minimum communication steps

AU - Al-Dubai, Ahmed Y.

AU - Ould-Khaoua, Mohamed

PY - 2003/4/25

Y1 - 2003/4/25

N2 - Many broadcast algorithms have been proposed for the mesh in the literature. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by this observation, this paper makes two contributions. Firstly, in an effort to minimise the effects of network size on communication performance, this study proposes a new routing approach that enables the development of efficient broadcast algorithms that can maintain good performance levels for various mesh sizes. Secondly, based on the new routing approach, we propose a new adaptive broadcast algorithm for the mesh. The main feature of the proposed algorithm is its ability to handle broadcast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

AB - Many broadcast algorithms have been proposed for the mesh in the literature. However, most of these algorithms do not exhibit good scalability properties as the network size increases. As a consequence, most existing broadcast algorithms cannot support real-world parallel applications that require large-scale system sizes due to their high computational demands. Motivated by this observation, this paper makes two contributions. Firstly, in an effort to minimise the effects of network size on communication performance, this study proposes a new routing approach that enables the development of efficient broadcast algorithms that can maintain good performance levels for various mesh sizes. Secondly, based on the new routing approach, we propose a new adaptive broadcast algorithm for the mesh. The main feature of the proposed algorithm is its ability to handle broadcast operations with a fixed number of message-passing steps irrespective of the network size. Results from extensive comparative analysis reveal that our algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

KW - Collective communication

KW - Interconnection networks

KW - Performance analysis

KW - Wormhole routing

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

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

U2 - 10.1016/S0141-9331(02)00094-7

DO - 10.1016/S0141-9331(02)00094-7

M3 - Article

VL - 27

SP - 101

EP - 113

JO - Microprocessors and Microsystems

JF - Microprocessors and Microsystems

SN - 0141-9331

IS - 3

ER -