Contention Bounds for Combinations of Computation Graphs and Network Topologies
作者:Grey Ballard;James Demmel;Andrew Gearhart;Benjamin Lipshitz;Oded Schwartz;Sivan Toledo 作者单位:EECS Department, University of California, Berkeley 加工时间:2015-04-08 信息来源:EECS 索取原文[11 页]
关键词:网络拓扑;计算图表;网络链接;通信 摘 要: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).