Name
Abstract | ||
|---|---|---|
A message passing interface (MPI) collective operation such as broadcast involves multiple processes. The process arrival pattern denotes the timing when each process arrives at a collective operation. It can have a profound impact on the performance since it decides the time when each process can start participating in the operation. In this paper, we investigate the broadcast operation with different process arrival patterns. We analyze commonly used broadcast algorithms and show that they cannot guarantee high performance for different process arrival patterns. We develop two process arrival pattern aware algorithms for broadcasting large messages. The performance of proposed algorithms is theoretically within a constant factor of the optimal for any given process arrival pattern. Our experimental evaluation confirms the analytical results: existing broadcast algorithms cannot achieve high performance for many process arrival patterns while the proposed algorithms are robust and efficient across different process arrival patterns. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1109/IPDPS.2008.4536308 | IPDPS |
Keywords | Field | DocType |
message passing,broadcast operation,collective operation,message passing interface,pattern analysis,algorithm design and analysis,computer science,scattering,robustness,broadcasting | Broadcast algorithm,Broadcasting,Algorithm design,Computer science,Parallel computing,Pattern analysis,Robustness (computer science),Message Passing Interface,Message passing,Distributed computing | Conference |
ISSN | ISBN | Citations |
1530-2075 E-ISBN : 978-1-4244-1694-3 | 978-1-4244-1694-3 | 10 |
PageRank | References | Authors |
0.67 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pitch Patarasuk | 1 | 142 | 8.91 |
| Xin Yuan | 2 | 1089 | 92.27 |