arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1507.06702cs.DCcs.DScs.PFcs.SE
收藏

大规模分布式图算法剖析

The Anatomy of Large-Scale Distributed Graph Algorithms

Jesun Sahariar Firoz, Thejaka Amila Kanewala, Marcin Zalewski, Martina Barnas, Andrew Lumsdaine

摘要:

现代超级计算机的软件/硬件堆栈的复杂性不断增加,导致参数爆炸。性能分析成为一门真正的实验科学,在存在大量不规则性和数据依赖性的情况下更具挑战性。我们分析了现有的研究机构如何处理分布式图算法(DGAs)的背景下的实验方面。我们区分算法级别的贡献,通常由作者优先考虑,从运行时级别的关注,更难放置。我们表明,运行时是这样一个不可分割的一部分,DGA的实验结果是很难解释和外推,而不了解所使用的运行时的属性。我们认为,为了了解运行时的影响,需要收集更多的信息。为了开始这一过程,我们提供了一套初步的建议,描述DGA结果的基础上,我们的分析领域的当前状态。

英文摘要:

The increasing complexity of the software/hardware stack of modern supercomputers results in explosion of parameters. The performance analysis becomes a truly experimental science, even more challenging in the presence of massive irregularity and data dependency. We analyze how the existing body of research handles the experimental aspect in the context of distributed graph algorithms (DGAs). We distinguish algorithm-level contributions, often prioritized by authors, from runtime-level concerns that are harder to place. We show that the runtime is such an integral part of DGAs that experimental results are difficult to interpret and extrapolate without understanding the properties of the runtime used. We argue that in order to gain understanding about the impact of runtimes, more information needs to be gathered. To begin this process, we provide an initial set of recommendations for describing DGA results based on our analysis of the current state of the field.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑