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

一种瘦自稳定异步协调算法及其在容错生物网络中的应用

A Thin Self-Stabilizing Asynchronous Unison Algorithm with Applications to Fault Tolerant Biological Networks

Yuval Emek, Eyal Keren

摘要:

由Emek和Wattenhofer(PODC 2013)引入的\emph{stone age (SA)}模型为分布在随机有限状态机上的网络算法提供了抽象。该模型旨在模拟细胞网络中生物过程的动态,假设一个弱通信方案,该方案建立在节点以异步方式感知其附近的能力之上。最近的工作表明,SA模型的计算和通信能力弱,足以有效地解决分布式计算中的一些核心任务,但他们这样做的假设下(有点不太现实)的无故障计算。在本文中,我们开始研究的\emph{self-stabilizing} SA算法,保证从任何组合的瞬态故障恢复。具体而言,我们开发了高效的自稳定SA算法的\emph{leader election}和\emph{maximal independent set}任务有界直径图受到异步调度。这些算法依赖于一种新的高效的自稳定\emph{asynchronous unison (AU)}算法,该算法在其状态空间方面是“瘦”的:AU算法所使用的状态数在图的直径范围内是线性的,与节点数无关。

英文摘要:

Introduced by Emek and Wattenhofer (PODC 2013), the \emph{stone age (SA)} model provides an abstraction for network algorithms distributed over randomized finite state machines. This model, designed to resemble the dynamics of biological processes in cellular networks, assumes a weak communication scheme that is built upon the nodes' ability to sense their vicinity in an asynchronous manner. Recent works demonstrate that the weak computation and communication capabilities of the SA model suffice for efficient solutions to some core tasks in distributed computing, but they do so under the (somewhat less realistic) assumption of fault free computations. In this paper, we initiate the study of \emph{self-stabilizing} SA algorithms that are guaranteed to recover from any combination of transient faults. Specifically, we develop efficient self-stabilizing SA algorithms for the \emph{leader election} and \emph{maximal independent set} tasks in bounded diameter graphs subject to an asynchronous scheduler. These algorithms rely on a novel efficient self-stabilizing \emph{asynchronous unison (AU)} algorithm that is "thin" in terms of its state space: the number of states used by the AU algorithm is linear in the graph's diameter bound, irrespective of the number of nodes.

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

↑