A scalable plane-based broadcast algorithm for 3D-Mesh networks

A. Y. Al-Dubai; M. Ould-Khaoua; L. Mackenzie

doi:10.1109/EMPDP.2003.1183581

A scalable plane-based broadcast algorithm for 3D-Mesh networks

A. Y. Al-Dubai, M. Ould-Khaoua, L. Mackenzie

Electrical and Computer Engineering

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

2 Citations (Scopus)

Abstract

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 algorithms. Motivated by these observations, this paper presents a new efficient broadcast algorithm for the mesh. The main feature of the proposed algorithm lies in its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, its 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 reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node.

Original language	English
Title of host publication	Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	149-156
Number of pages	8
ISBN (Print)	0769518753, 9780769518756
DOIs	https://doi.org/10.1109/EMPDP.2003.1183581
Publication status	Published - 2003
Event	11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 - Genova, Italy Duration: Feb 5 2003 → Feb 7 2003

Other

Other	11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003
Country/Territory	Italy
City	Genova
Period	2/5/03 → 2/7/03

Keywords

Broadcasting
Communication switching
Delay
Hardware
Network topology
Parallel processing
Performance analysis
Routing
Scalability
System recovery

ASJC Scopus subject areas

Computer Science Applications
Computational Theory and Mathematics
Computer Networks and Communications
Hardware and Architecture

Access to Document

10.1109/EMPDP.2003.1183581

Cite this

A scalable plane-based broadcast algorithm for 3D-Mesh networks. / Al-Dubai, A. Y.; Ould-Khaoua, M.; Mackenzie, L.

Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003. Institute of Electrical and Electronics Engineers Inc., 2003. p. 149-156 1183581.

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

Al-Dubai, AY, Ould-Khaoua, M & Mackenzie, L 2003, A scalable plane-based broadcast algorithm for 3D-Mesh networks. in Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003., 1183581, Institute of Electrical and Electronics Engineers Inc., pp. 149-156, 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003, Genova, Italy, 2/5/03. https://doi.org/10.1109/EMPDP.2003.1183581

@inproceedings{42695eefd4b1404887ed2d3b67f29fa7,

title = "A scalable plane-based broadcast algorithm for 3D-Mesh networks",

abstract = "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 algorithms. Motivated by these observations, this paper presents a new efficient broadcast algorithm for the mesh. The main feature of the proposed algorithm lies in its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, its 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 reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node.",

keywords = "Broadcasting, Communication switching, Delay, Hardware, Network topology, Parallel processing, Performance analysis, Routing, Scalability, System recovery",

author = "Al-Dubai, {A. Y.} and M. Ould-Khaoua and L. Mackenzie",

year = "2003",

doi = "10.1109/EMPDP.2003.1183581",

language = "English",

isbn = "0769518753",

pages = "149--156",

booktitle = "Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 ; Conference date: 05-02-2003 Through 07-02-2003",

}

TY - GEN

T1 - A scalable plane-based broadcast algorithm for 3D-Mesh networks

AU - Al-Dubai, A. Y.

AU - Ould-Khaoua, M.

AU - Mackenzie, L.

PY - 2003

Y1 - 2003

N2 - 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 algorithms. Motivated by these observations, this paper presents a new efficient broadcast algorithm for the mesh. The main feature of the proposed algorithm lies in its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, its 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 reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node.

AB - 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 algorithms. Motivated by these observations, this paper presents a new efficient broadcast algorithm for the mesh. The main feature of the proposed algorithm lies in its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, its 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 reveal that the new algorithm exhibits superior performance characteristics over those of the well-known Recursive Doubling, Extending Dominating Node.

KW - Broadcasting

KW - Communication switching

KW - Delay

KW - Hardware

KW - Network topology

KW - Parallel processing

KW - Performance analysis

KW - Routing

KW - Scalability

KW - System recovery

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

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

U2 - 10.1109/EMPDP.2003.1183581

DO - 10.1109/EMPDP.2003.1183581

M3 - Conference contribution

AN - SCOPUS:33745197852

SN - 0769518753

SN - 9780769518756

SP - 149

EP - 156

BT - Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003

Y2 - 5 February 2003 through 7 February 2003

ER -

A scalable plane-based broadcast algorithm for 3D-Mesh networks

Abstract

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this