欢迎访问行业研究报告数据库

行业分类

当前位置:首页 > 报告详细信息

找到报告 1 篇 当前为第 1 页 共 1

计算图表与网络拓扑结合的竞争范围

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).
© 2016 武汉世讯达文化传播有限责任公司 版权所有 技术支持:武汉中网维优
客服中心

QQ咨询


点击这里给我发消息 客服员


电话咨询


027-87841330


微信公众号




展开客服