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 efficient broadcast algorithm for the mesh. The main feature of the proposed algorithm lies in its ability to perform broadcast operation with a high degree of scalability and parallelism. Furthermore, its performance is insensitive to the network size, i.e., only three 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.
Original language | English |
---|---|
Title of host publication | Proceedings - 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 149-156 |
Number of pages | 8 |
ISBN (Print) | 0769518753, 9780769518756 |
DOIs | |
Publication status | Published - 2003 |
Event | 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 - Genova, Italy Duration: Feb 5 2003 → Feb 7 2003 |
Other
Other | 11th Euromicro Conference on Parallel, Distributed and Network-Based Processing, Euro-PDP 2003 |
---|---|
Country | Italy |
City | Genova |
Period | 2/5/03 → 2/7/03 |
Keywords
- Broadcasting
- Communication switching
- Delay
- Hardware
- Network topology
- Parallel processing
- Performance analysis
- Routing
- Scalability
- System recovery
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Computer Networks and Communications
- Hardware and Architecture