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

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)