通过约简的细粒度I/O复杂度:新的下限、更快的算法和时间层次
Fine-Grained I/O Complexity via Reductions: New lower bounds, faster algorithms, and a time hierarchy
摘要:
本文从细粒度复杂度(条件多项式下界)的角度出发,对I/O算法(最小化缓存未命中)进行了研究。具体来说,我们的目标是回答为什么稀疏图的问题是如此困难,为什么最长的公共子序列的问题得到了一个因素的高速缓存的大小乘以高速缓存行的长度,但没有更多的节省。我们从复杂性和细粒度复杂性中提取减少和技术,并将其应用于I/O模型,以生成新的(条件)下限以及更快的算法。我们还证明了存在的时间层次的I/O模型,这激励细粒度的减少。使用细粒度的减少,我们给出了一个算法,用于区分2与3的直径和半径,运行在$O(|E|^2/(MB))$缓存未命中,稀疏图,提高了以前的$O(|V|^2/B)$运行时间。我们给出了从半径和直径到Wiener指数和中值的新的约化。我们表现出有意义的减少之间的问题,在RAM模型中的线性时间的解决方案。这些缩减使用低I/O复杂度(通常为$O(n/B)$),因此有助于精确地捕获“I/O线性时间”$Θ(n/B)$和RAM线性时间$Θ(n)$之间的关系。我们生成新的I/O假设的基础上,提高稀疏图问题的运行时间在I/O模型的困难。我们创建的apturtures,目前最知名的算法单源最短路径(SSSP),直径和半径是最佳的。从这些I/O模型假设,我们表明,许多已知的减少字RAM模型可以自然地扩展到保持在I/O模型以及(例如,匹配最佳已知运行时间的最长公共子序列的I/O复杂度的下限)。最后,我们证明了一个模拟的时间层次定理的I/O模型。
英文摘要:
This paper initiates the study of I/O algorithms (minimizing cache misses) from the perspective of fine-grained complexity (conditional polynomial lower bounds). Specifically, we aim to answer why sparse graph problems are so hard, and why the Longest Common Subsequence problem gets a savings of a factor of the size of cache times the length of a cache line, but no more. We take the reductions and techniques from complexity and fine-grained complexity and apply them to the I/O model to generate new (conditional) lower bounds as well as faster algorithms. We also prove the existence of a time hierarchy for the I/O model, which motivates the fine-grained reductions. Using fine-grained reductions, we give an algorithm for distinguishing 2 vs. 3 diameter and radius that runs in $O(|E|^2/(MB))$ cache misses, which for sparse graphs improves over the previous $O(|V|^2/B)$ running time. We give new reductions from radius and diameter to Wiener index and median. We show meaningful reductions between problems that have linear-time solutions in the RAM model. The reductions use low I/O complexity (typically $O(n/B)$), and thus help to finely capture the relationship between "I/O linear time" $Θ(n/B)$ and RAM linear time $Θ(n)$. We generate new I/O assumptions based on the difficulty of improving sparse graph problem running times in the I/O model. We create conjectures that the current best known algorithms for Single Source Shortest Paths (SSSP), diameter, and radius are optimal. From these I/O-model assumptions, we show that many of the known reductions in the word-RAM model can naturally extend to hold in the I/O model as well (e.g., a lower bound on the I/O complexity of Longest Common Subsequence that matches the best known running time). Finally, we prove an analog of the Time Hierarchy Theorem in the I/O model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。