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

完全格线性算法

Fully Lattice-Linear Algorithms

Arya Tanmay Gupta, Sandeep S Kulkarni

AI总结:

本文引入完全格线性算法,将整个可达状态空间划分为一个或多个格以确保节点异步执行的正确性,提出针对MDS、GC等问题的自稳定算法并改进现有算法,还提出更宽松的≺-格数据结构。

摘要:

格线性是一种利用谓词对问题进行建模的方法,这些谓词会在全局状态中诱导出一个格(Garg,SPAA 2020)。表示此类问题的谓词的关键特性是,它会在状态空间中诱导出一个格。由这种谓词生成的算法可保证,即使节点异步执行,也能正确执行。然而,许多有趣的问题并不具有格线性。随着最终格线性算法的引入,这一问题在一定程度上得到了缓解(Gupta 和 Kulkarni,SSS 2021)。即使问题无法由在全局状态中形成格的谓词定义,这些算法也会在状态空间的一个子集中诱导出单个或多个格。本文重点分析并区分格线性问题与算法。我们引入了完全格线性算法。这些算法将整个可达状态空间划分为一个或多个格,因此即使节点异步执行,也能确保执行的正确性。为了演示,我们提出了针对最小支配集(MDS)、图着色(GC)、最小顶点覆盖(MVC)和最大独立集(MIS)问题的格线性自稳定算法。针对MDS、MVC和MIS的算法收敛时间为n步,针对GC的算法收敛时间为n+2m步。这些算法在允许节点异步执行的同时,保留了这种时间复杂度。它们对文献中现有的算法进行了改进。我们的工作还表明,为了允许异步执行,可以使用一种更宽松的数据结构(本文中称为≺-格,其中一对全局状态的交可能未定义),而非Garg所假设的分配格。

英文摘要:

Lattice-linearity was introduced as a way to model problems using predicates that induce a lattice among the global states (Garg, SPAA 2020). A key property of \textit{the predicate} representing such problems is that it induces \textit{one} lattice in the state space. An algorithm that emerges from such a predicate guarantees the execution to be correct even if nodes execute asynchronously. However, many interesting problems do not exhibit lattice-linearity. This issue was somewhat alleviated with the introduction of eventually lattice-linear algorithms (Gupta and Kulkarni, SSS 2021). They induce \textit{single} or \textit{multiple} lattices in \textit{a subset of the state space} even when the problem cannot be defined by a predicate under which the global states form a lattice. This paper focuses on analyzing and differentiating between lattice-linear problems and algorithms. We introduce \textit{fully lattice-linear algorithms}. These algorithms partition the \textit{entire} reachable state space into \textit{one or more lattices}, and as a result, ensure that the execution remains correct even if nodes execute asynchronously. For demonstration, we present lattice-linear self-stabilizing algorithms for minimal dominating set (MDS), graph colouring (GC), minimal vertex cover (MVC) and maximal independent set (MIS) problems. The algorithms for MDS, MVC and MIS converge in $n$ moves and the algorithm for GC converges in $n+2m$ moves. These algorithms preserve this time complexity while allowing the nodes to execute asynchronously. They present an improvement to the existing algorithms present in the literature. Our work also demonstrates that to allow asynchrony, a more relaxed data structure can be allowed (called $\prec$-lattice in this paper, where the meet of a pair of global states may not be defined), rather than a distributive lattice as assumed by Garg.

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

↑