TY - BOOK
T1 - Contention Bounds for Combinations of Computation Graphs and Network Topologies
T2 - Technical Report No. UCB/EECS-2014-147
AU - Ballard, Grey
AU - Demmel, James
AU - Gearhart, Andrew
AU - Lipshitz, Benjamin
AU - Schwartz, Oded
AU - Toledo, Sivan
PY - 2014
Y1 - 2014
N2 - Network topologies can have significant effect on the costs of algorithms due to inter-processor communication. Parallel algorithms that ignore network topology can suffer from contention along network links. However, for particular combinations of computations and network topologies, costly network contention may inevitably become a bottleneck, even for optimally designed algorithms. We obtain a novel contention lower bound that is a function of the network and the computation graph parameters. To this end, we compare the communication bandwidth needs of subsets of processors and the available network capacity (as opposed to per-processor analysis in most previous studies). Applying this analysis we improve communication cost lower bounds for several combinations of fundamental computations on common network topologies.
AB - Network topologies can have significant effect on the costs of algorithms due to inter-processor communication. Parallel algorithms that ignore network topology can suffer from contention along network links. However, for particular combinations of computations and network topologies, costly network contention may inevitably become a bottleneck, even for optimally designed algorithms. We obtain a novel contention lower bound that is a function of the network and the computation graph parameters. To this end, we compare the communication bandwidth needs of subsets of processors and the available network capacity (as opposed to per-processor analysis in most previous studies). Applying this analysis we improve communication cost lower bounds for several combinations of fundamental computations on common network topologies.
M3 - ???researchoutput.researchoutputtypes.bookanthology.commissioned???
BT - Contention Bounds for Combinations of Computation Graphs and Network Topologies
PB - University of California Press
ER -