Coded path routing

A new approach to broadcasting in 3-D meshes

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

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

9 Citations (Scopus)

Abstract

Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an 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 publicationIEEE International Performance, Computing and Communications Conference, Proceedings
Pages155-162
Number of pages8
Publication statusPublished - 2001
Event20th IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States
Duration: Apr 4 2001Apr 6 2001

Other

Other20th IEEE International Performance, Computing, and Communications Conference
CountryUnited States
CityPhoenix, AZ
Period4/4/014/6/01

Fingerprint

Broadcasting
Switching networks
Message passing
Communication

Keywords

  • Broadcast
  • Interconnection networks
  • Performance analysis
  • Wormhole switching

ASJC Scopus subject areas

  • Media Technology

Cite this

Al-Dubai, A. Y., & Ould-Khaoua, M. (2001). Coded path routing: A new approach to broadcasting in 3-D meshes. In IEEE International Performance, Computing and Communications Conference, Proceedings (pp. 155-162)

Coded path routing : A new approach to broadcasting in 3-D meshes. / Al-Dubai, A. Y.; Ould-Khaoua, M.

IEEE International Performance, Computing and Communications Conference, Proceedings. 2001. p. 155-162.

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

Al-Dubai, AY & Ould-Khaoua, M 2001, Coded path routing: A new approach to broadcasting in 3-D meshes. in IEEE International Performance, Computing and Communications Conference, Proceedings. pp. 155-162, 20th IEEE International Performance, Computing, and Communications Conference, Phoenix, AZ, United States, 4/4/01.
Al-Dubai AY, Ould-Khaoua M. Coded path routing: A new approach to broadcasting in 3-D meshes. In IEEE International Performance, Computing and Communications Conference, Proceedings. 2001. p. 155-162
Al-Dubai, A. Y. ; Ould-Khaoua, M. / Coded path routing : A new approach to broadcasting in 3-D meshes. IEEE International Performance, Computing and Communications Conference, Proceedings. 2001. pp. 155-162
@inproceedings{8586500c0eb24362bac81cc6b9a582c7,
title = "Coded path routing: A new approach to broadcasting in 3-D meshes",
abstract = "Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an 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 = "Broadcast, Interconnection networks, Performance analysis, Wormhole switching",
author = "Al-Dubai, {A. Y.} and M. Ould-Khaoua",
year = "2001",
language = "English",
pages = "155--162",
booktitle = "IEEE International Performance, Computing and Communications Conference, Proceedings",

}

TY - GEN

T1 - Coded path routing

T2 - A new approach to broadcasting in 3-D meshes

AU - Al-Dubai, A. Y.

AU - Ould-Khaoua, M.

PY - 2001

Y1 - 2001

N2 - Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an 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 - Broadcast is an important collective communication operation required by many real-world parallel applications. This paper proposes the Coded Path Routing (or CPR for short) as a new approach for designing efficient broadcast algorithms for wormhole-switched multicomputer networks. A unique feature of the CPR is that a message can be delivered to an arbitrary number of destination nodes with single start-up latency. The CPR is then used to devise a new broadcast algorithm for the all-port 3-dimensional mesh. The algorithm requires a fixed number of message-passing steps to implement a broadcast operation irrespective of the network size. Results from an 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 - Broadcast

KW - Interconnection networks

KW - Performance analysis

KW - Wormhole switching

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

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

M3 - Conference contribution

SP - 155

EP - 162

BT - IEEE International Performance, Computing and Communications Conference, Proceedings

ER -