计算图的I/O复杂度的谱下界
Spectral Lower Bounds on the I/O Complexity of Computation Graphs
摘要:
我们考虑的问题找到下界的任意计算的I/O复杂性在两个层次的存储层次结构。复杂计算的执行可以形式化为底层计算图上的评估顺序。然而,用于寻找I/O下限的现有方法利用了不能应用于任意图的特定问题(例如矩阵乘法)的图结构。在本文中,我们首先提出了一种新的方法来绑定的I/O的任何计算图使用的前几个特征值的图形的拉普拉斯算子。我们进一步扩展到平行的设置。这个谱界不仅可以通过幂迭代有效地计算,而且对于已知谱的图也可以以封闭形式计算。我们应用我们的谱方法来计算封闭形式的分析边界上的两个计算图(Bellman-Held-Karp算法的旅行商问题和快速傅立叶变换),以及提供一个随机Erdos Renyi图的概率界。我们经验验证我们的四个计算图上的界限,并发现我们的方法提供了更严格的界限比目前的经验方法和行为类似于以前公布的I/O界限。
英文摘要:
We consider the problem of finding lower bounds on the I/O complexity of arbitrary computations in a two level memory hierarchy. Executions of complex computations can be formalized as an evaluation order over the underlying computation graph. However, prior methods for finding I/O lower bounds leverage the graph structures for specific problems (e.g matrix multiplication) which cannot be applied to arbitrary graphs. In this paper, we first present a novel method to bound the I/O of any computation graph using the first few eigenvalues of the graph's Laplacian. We further extend this bound to the parallel setting. This spectral bound is not only efficiently computable by power iteration, but can also be computed in closed form for graphs with known spectra. We apply our spectral method to compute closed-form analytical bounds on two computation graphs (the Bellman-Held-Karp algorithm for the traveling salesman problem and the Fast Fourier Transform), as well as provide a probabilistic bound for random Erdos Renyi graphs. We empirically validate our bound on four computation graphs, and find that our method provides tighter bounds than current empirical methods and behaves similarly to previously published I/O bounds.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。