arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2106.01880cs.DScs.DC
收藏

低空间大规模并行计算中的构件稳定性

Component Stability in Low-Space Massively Parallel Computation

Artur Czumaj, Peter Davies, Merav Parter

摘要:

我们研究了组件稳定算法在大规模并行计算(MPC)的低空间模型中的能力和局限性。最近,Ghaffari,Kuhn和Uitto(FOCS 2019)引入了一类组件稳定的低空间MPC算法,非正式地定义为要求不同连接组件中的节点报告的输出独立的算法。这个非常自然的概念被引入来捕获迄今为止大多数(如果不是全部)已知的有效MPC算法,并且它是第一类可以显示非平凡条件下界的MPC算法。在本文中,我们加强了组件稳定算法的框架,并研究其对随机和确定性低空间MPC的复杂性的影响。我们的主要贡献包括:1)我们修改和形式化的提升方法的Ghaffari,库恩和Uitto。这需要对组件稳定性的概念进行非常微妙的修正,这使我们能够填补早期论点中的空白。2)我们还扩展了框架,以获得确定性算法的条件下界和细粒度的下界,取决于最大程度的$Δ$。3)我们展示了一系列自然图问题,其中非组件稳定算法打破了组件稳定算法的条件下界。这意味着,无论是确定性和随机算法,组件稳定的算法是有条件的弱于非组件稳定的。总之,我们的研究结果表明,组件的稳定性可能会限制低空间MPC模型的计算能力,至少在某些情况下,为改进的上限,逃避有条件的下限设置的Ghaffari,库恩和Uitto铺平了道路。

英文摘要:

We study the power and limitations of component-stable algorithms in the low-space model of Massively Parallel Computation (MPC). Recently Ghaffari, Kuhn and Uitto (FOCS 2019) introduced the class of component-stable low-space MPC algorithms, which are, informally, defined as algorithms for which the outputs reported by the nodes in different connected components are required to be independent. This very natural notion was introduced to capture most (if not all) of the known efficient MPC algorithms to date, and it was the first general class of MPC algorithms for which one can show non-trivial conditional lower bounds. In this paper we enhance the framework of component-stable algorithms and investigate its effect on the complexity of randomized and deterministic low-space MPC. Our key contributions include: 1) We revise and formalize the lifting approach of Ghaffari, Kuhn and Uitto. This requires a very delicate amendment of the notion of component stability, which allows us to fill in gaps in the earlier arguments. 2) We also extend the framework to obtain conditional lower bounds for deterministic algorithms and fine-grained lower bounds that depend on the maximum degree $Δ$. 3) We demonstrate a collection of natural graph problems for which non-component-stable algorithms break the conditional lower bound obtained for component-stable algorithms. This implies that, for both deterministic and randomized algorithms, component-stable algorithms are conditionally weaker than the non-component-stable ones. Altogether our results imply that component-stability might limit the computational power of the low-space MPC model, at least in certain contexts, paving the way for improved upper bounds that escape the conditional lower bound setting of Ghaffari, Kuhn, and Uitto.

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

↑