具有最优记忆的MPC局部指数加速比
Exponential Speedup Over Locality in MPC with Optimal Memory
摘要:
局部可检查标号(LCL)问题是一个图问题,如果它的解在每个节点的局部邻域内满足给定的约束条件,则它是正确的。这类问题的例子包括最大匹配、最大独立集和着色问题。一个成功的研究路线一直在研究LCL问题的复杂性的路径/循环,树,和一般的图形,提供了许多有趣的结果,分布式计算的并行计算模型。在这项工作中,我们开始在低空间大规模并行计算(MPC)模型的LCL问题的研究。特别是,在森林,我们提供了一种方法,考虑到LCL问题的复杂性,自动提供了一个指数更快的算法的低空间MPC设置,使用最佳的全局内存,即真正的线性。虽然限制到森林似乎削弱了结果,但我们强调,MPC设置的所有已知(条件)下限都是通过提升树状网络(森林或高围长图)中分布式设置中获得的下限而获得的,因此我们研究的问题已经在森林上具有挑战性。此外,我们的算法的最重要的技术特点是,他们使用最佳的全局内存,即内存线性图的边数。相比之下,大多数最先进的算法使用的不仅仅是线性全局内存。此外,他们通常从密集图开始,将其稀疏化,然后在残差图上解决问题,利用全局内存的相对增加。在森林中,这是不可能的,因为给定的图已经尽可能稀疏,并且使用最佳内存需要新的解决方案。
英文摘要:
Locally Checkable Labeling (LCL) problems are graph problems in which a solution is correct if it satisfies some given constraints in the local neighborhood of each node. Example problems in this class include maximal matching, maximal independent set, and coloring problems. A successful line of research has been studying the complexities of LCL problems on paths/cycles, trees, and general graphs, providing many interesting results for the LOCAL model of distributed computing. In this work, we initiate the study of LCL problems in the low-space Massively Parallel Computation (MPC) model. In particular, on forests, we provide a method that, given the complexity of an LCL problem in the LOCAL model, automatically provides an exponentially faster algorithm for the low-space MPC setting that uses optimal global memory, that is, truly linear. While restricting to forests may seem to weaken the result, we emphasize that all known (conditional) lower bounds for the MPC setting are obtained by lifting lower bounds obtained in the distributed setting in tree-like networks (either forests or high girth graphs), and hence the problems that we study are challenging already on forests. Moreover, the most important technical feature of our algorithms is that they use optimal global memory, that is, memory linear in the number of edges of the graph. In contrast, most of the state-of-the-art algorithms use more than linear global memory. Further, they typically start with a dense graph, sparsify it, and then solve the problem on the residual graph, exploiting the relative increase in global memory. On forests, this is not possible, because the given graph is already as sparse as it can be, and using optimal memory requires new solutions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。