Towards a scalable broadcast in wormhole-switched mesh networks

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

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

1 Citation (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 broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two 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 and Network Partitioning algorithms.

Original languageEnglish
Title of host publicationProceedings of the ACM Symposium on Applied Computing
Pages840-844
Number of pages5
Publication statusPublished - 2002
EventApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain
Duration: Mar 11 2002Mar 14 2002

Other

OtherApplied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing
CountrySpain
CityMadrid
Period3/11/023/14/02

Fingerprint

Message passing

Keywords

  • Collective communication
  • Communication Latency
  • Interconnection networks
  • Routing
  • Wormhole switching

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Al-Dubai, A. Y., Ould-Khaoua, M., & Mackenzie, L. M. (2002). Towards a scalable broadcast in wormhole-switched mesh networks. In Proceedings of the ACM Symposium on Applied Computing (pp. 840-844)

Towards a scalable broadcast in wormhole-switched mesh networks. / Al-Dubai, A. Y.; Ould-Khaoua, M.; Mackenzie, L. M.

Proceedings of the ACM Symposium on Applied Computing. 2002. p. 840-844.

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

Al-Dubai, AY, Ould-Khaoua, M & Mackenzie, LM 2002, Towards a scalable broadcast in wormhole-switched mesh networks. in Proceedings of the ACM Symposium on Applied Computing. pp. 840-844, Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 3/11/02.
Al-Dubai AY, Ould-Khaoua M, Mackenzie LM. Towards a scalable broadcast in wormhole-switched mesh networks. In Proceedings of the ACM Symposium on Applied Computing. 2002. p. 840-844
Al-Dubai, A. Y. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Towards a scalable broadcast in wormhole-switched mesh networks. Proceedings of the ACM Symposium on Applied Computing. 2002. pp. 840-844
@inproceedings{0b403d579be8403f8b3fa9a555a95522,
title = "Towards a scalable broadcast in wormhole-switched 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 broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two 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 and Network Partitioning algorithms.",
keywords = "Collective communication, Communication Latency, Interconnection networks, Routing, Wormhole switching",
author = "Al-Dubai, {A. Y.} and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2002",
language = "English",
pages = "840--844",
booktitle = "Proceedings of the ACM Symposium on Applied Computing",

}

TY - GEN

T1 - Towards a scalable broadcast in wormhole-switched mesh networks

AU - Al-Dubai, A. Y.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2002

Y1 - 2002

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 broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two 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 and Network Partitioning algorithms.

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 broadcast algorithm based on our previously proposed Coded Path Routing (or CPR for short) [1]. The main feature of the proposed algorithm lies in its ability to perform broadcast operations with a high degree of parallelism. Furthermore, its performance is insensitive to the network size, i.e., only two 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 and Network Partitioning algorithms.

KW - Collective communication

KW - Communication Latency

KW - Interconnection networks

KW - Routing

KW - Wormhole switching

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

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

M3 - Conference contribution

AN - SCOPUS:0036041495

SP - 840

EP - 844

BT - Proceedings of the ACM Symposium on Applied Computing

ER -