arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2410.22237cs.DScs.CC
收藏

I/O复杂性与部分计算的 Pebble 游戏

I/O complexity and pebble games with partial computations

IBM Research(IBM 研究院);ETH Zurich(苏黎世联邦理工学院);Huawei Technologies Switzerland AG(华为瑞士技术有限公司)

Aleksandros Sobczyk

AI总结:

本文提出了一种允许部分计算的 Pebble 游戏变体,用于建模具有任意入度的 DAG,证明了在特定条件下决定最优 Pebbling 策略的 NP 完全性,并给出了特殊情况的近似算法。

摘要:

在程序执行过程中优化数据移动对于实现现代计算系统高性能至关重要。这通常通过红蓝 Pebble 游戏及其变体进行经典建模。在现有模型中,通常假设红色 Pebble 的数量,即快速内存的大小,大于计算有向无环图(DAG)中的最大入度。不满足此约束的图需要先适当转换,这在一般图中并非 trivial 任务。在本工作中,我们提出了一种 Pebble 游戏变体,用于建模具有任意入度的 DAG,通过允许部分计算。在新模型中,我们显示决定是否存在成本为 k 的最优 Pebbling 策略是 NP 完全的,即使对于单级 DAG 和仅当两个单词适合快速内存时也是如此。还概述了特殊情况的近似算法。

英文摘要:

Optimizing data movements during program executions is essential for achieving high performance in modern computing systems. This has been classically modeled with the Red-Blue Pebble Game and its variants. In existing models, it is typically assumed that the number of red pebbles, i.e., the size of the fast memory, is larger than the maximum in-degree in the computational directed acyclic graph (DAG). Graphs that do not satisfy this constraint need to be first transformed appropriately, which is not a trivial task for general graphs. In this work we propose a Pebble Game variant to model DAGs with arbitrary in-degrees, by allowing partial computations. In the new model, we show that it is NP-complete to decide whether there exists an optimal pebbling strategy with cost $k$, even for single-level DAGs and when only two words fit in the fast memory. Approximation algorithms for special cases are also outlined.

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

↑