An efficient adaptive broadcast algorithm for the mesh network

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

Most existing broadcast algorithms proposed for the mesh do not scale well with the network size. Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative paths provided by mesh topology to reduce communication latency. Motivated by these observations, this paper introduces a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. 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 languageEnglish
Title of host publicationProceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS
Pages83-90
Number of pages8
Publication statusPublished - 2001
Event8th International Conference on Parallel and Distributed Systems - Kyongju, Korea, Republic of
Duration: Jun 26 2001Jun 29 2001

Other

Other8th International Conference on Parallel and Distributed Systems
CountryKorea, Republic of
CityKyongju
Period6/26/016/29/01

Fingerprint

Adaptive algorithms
Message passing
Topology
Communication

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Al-Dubai, A. Y., & Ould-Khaoua, M. (2001). An efficient adaptive broadcast algorithm for the mesh network. In Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS (pp. 83-90)

An efficient adaptive broadcast algorithm for the mesh network. / Al-Dubai, A. Y.; Ould-Khaoua, M.

Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. p. 83-90.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Al-Dubai, AY & Ould-Khaoua, M 2001, An efficient adaptive broadcast algorithm for the mesh network. in Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. pp. 83-90, 8th International Conference on Parallel and Distributed Systems, Kyongju, Korea, Republic of, 6/26/01.
Al-Dubai AY, Ould-Khaoua M. An efficient adaptive broadcast algorithm for the mesh network. In Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. p. 83-90
Al-Dubai, A. Y. ; Ould-Khaoua, M. / An efficient adaptive broadcast algorithm for the mesh network. Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS. 2001. pp. 83-90
@inproceedings{f89c419f5db549678402db1c46b69252,
title = "An efficient adaptive broadcast algorithm for the mesh network",
abstract = "Most existing broadcast algorithms proposed for the mesh do not scale well with the network size. Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative paths provided by mesh topology to reduce communication latency. Motivated by these observations, this paper introduces a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. 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.",
author = "Al-Dubai, {A. Y.} and M. Ould-Khaoua",
year = "2001",
language = "English",
pages = "83--90",
booktitle = "Proceedings of the Internatoinal Conference on Parallel and Distributed Systems - ICPADS",

}

TY - GEN

T1 - An efficient adaptive broadcast algorithm for the mesh network

AU - Al-Dubai, A. Y.

AU - Ould-Khaoua, M.

PY - 2001

Y1 - 2001

N2 - Most existing broadcast algorithms proposed for the mesh do not scale well with the network size. Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative paths provided by mesh topology to reduce communication latency. Motivated by these observations, this paper introduces a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. 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 - Most existing broadcast algorithms proposed for the mesh do not scale well with the network size. Furthermore, they have been mainly based on deterministic routing, which cannot exploit the alternative paths provided by mesh topology to reduce communication latency. Motivated by these observations, this paper introduces a new adaptive broadcast algorithm for the mesh. The unique feature of our algorithm is its ability to handle broadcast operations with only two message-passing steps irrespective of the network size. 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.

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

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

M3 - Conference contribution

SP - 83

EP - 90

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

ER -