A scalable broadcast algorithm for multiport meshes with minimum communication steps

Ahmed Yassin Al-Dubai; Mohamed Ould-Khaoua

doi:10.1109/ICPADS.2002.1183400

A scalable broadcast algorithm for multiport meshes with minimum communication steps

Ahmed Yassin Al-Dubai, Mohamed Ould-Khaoua

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

Many broadcast algorithms have been proposed for the mesh over the past decade. 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 these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

Original language	English
Title of host publication	Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS
Publisher	IEEE Computer Society
Pages	203-208
Number of pages	6
Volume	2002-January
ISBN (Print)	0769517609
DOIs	https://doi.org/10.1109/ICPADS.2002.1183400
Publication status	Published - 2002
Event	9th International Conference on Parallel and Distributed Systems, ICPADS 2002 - Taiwan, China Duration: Dec 17 2002 → Dec 20 2002

Other

Other	9th International Conference on Parallel and Distributed Systems, ICPADS 2002
Country/Territory	China
City	Taiwan
Period	12/17/02 → 12/20/02

Keywords

Algorithm design and analysis
Broadcasting
Concurrent computing
Delay
Distributed computing
Large-scale systems
Partitioning algorithms
Performance analysis
Routing
Scalability

ASJC Scopus subject areas

Hardware and Architecture

Access to Document

10.1109/ICPADS.2002.1183400

Cite this

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

Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. Vol. 2002-January IEEE Computer Society, 2002. p. 203-208 1183400.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Al-Dubai, AY & Ould-Khaoua, M 2002, A scalable broadcast algorithm for multiport meshes with minimum communication steps. in Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS. vol. 2002-January, 1183400, IEEE Computer Society, pp. 203-208, 9th International Conference on Parallel and Distributed Systems, ICPADS 2002, Taiwan, China, 12/17/02. https://doi.org/10.1109/ICPADS.2002.1183400

@inproceedings{cf2ebe3f728e4fd4a1f3b15f097c9fb7,

title = "A scalable broadcast algorithm for multiport meshes with minimum communication steps",

abstract = "Many broadcast algorithms have been proposed for the mesh over the past decade. 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 these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.",

keywords = "Algorithm design and analysis, Broadcasting, Concurrent computing, Delay, Distributed computing, Large-scale systems, Partitioning algorithms, Performance analysis, Routing, Scalability",

author = "Al-Dubai, {Ahmed Yassin} and Mohamed Ould-Khaoua",

year = "2002",

doi = "10.1109/ICPADS.2002.1183400",

language = "English",

isbn = "0769517609",

volume = "2002-January",

pages = "203--208",

booktitle = "Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS",

publisher = "IEEE Computer Society",

note = "9th International Conference on Parallel and Distributed Systems, ICPADS 2002 ; Conference date: 17-12-2002 Through 20-12-2002",

}

TY - GEN

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

AU - Al-Dubai, Ahmed Yassin

AU - Ould-Khaoua, Mohamed

PY - 2002

Y1 - 2002

N2 - Many broadcast algorithms have been proposed for the mesh over the past decade. 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 these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed 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 over the past decade. 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 these observations, this study proposes a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is that it handles broadcast operations with a fixed number of message passing steps irrespective of the network size. Our algorithm is based on the coded path routing, which has been proposed in (Al-Dubai and Ould-Khaous, 2001). Results from extensive comparative analysis reveal that the proposed algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling and Extending Dominating Node algorithms.

KW - Algorithm design and analysis

KW - Broadcasting

KW - Concurrent computing

KW - Delay

KW - Distributed computing

KW - Large-scale systems

KW - Partitioning algorithms

KW - Performance analysis

KW - Routing

KW - Scalability

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

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

U2 - 10.1109/ICPADS.2002.1183400

DO - 10.1109/ICPADS.2002.1183400

M3 - Conference contribution

AN - SCOPUS:84948748059

SN - 0769517609

VL - 2002-January

SP - 203

EP - 208

BT - Proceedings of the International Conference on Parallel and Distributed Systems - ICPADS

PB - IEEE Computer Society

T2 - 9th International Conference on Parallel and Distributed Systems, ICPADS 2002

Y2 - 17 December 2002 through 20 December 2002

ER -

A scalable broadcast algorithm for multiport meshes with minimum communication steps

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this