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 language | English |
---|---|
Title of host publication | IEEE International Performance, Computing and Communications Conference, Proceedings |
Pages | 155-162 |
Number of pages | 8 |
Publication status | Published - 2001 |
Event | 20th IEEE International Performance, Computing, and Communications Conference - Phoenix, AZ, United States Duration: Apr 4 2001 → Apr 6 2001 |
Other
Other | 20th IEEE International Performance, Computing, and Communications Conference |
---|---|
Country/Territory | United States |
City | Phoenix, AZ |
Period | 4/4/01 → 4/6/01 |
Keywords
- Broadcast
- Interconnection networks
- Performance analysis
- Wormhole switching
ASJC Scopus subject areas
- Media Technology