非支持环境下的Dijkstra自稳定算法
Dijkstra's Self-Stabilizing Algorithm in Unsupportive Environments
摘要：
第一个自稳定算法[Dij 73]假设存在一个中央守护进程，该守护进程每次激活一个处理器，以根据其自身状态和邻居的状态来改变状态。随后的研究重新考虑了这种算法，没有中央守护进程的假设，并在不同形式的通信，如链接寄存器的模型。在所有这些研究中，一个共同的特征是通信的原子性，无论是通过共享变量还是读/写寄存器。本文削弱了通信模型的原子性假设，提出了容忍各种较弱形式的原子性的[Dij 73]版本。首先，提出了常规寄存器的情况下的解决方案。然后，安全寄存器的情况下被认为是消极和积极的结果。本文还提出了一种基于寄存器的[Dij 73]的实现，该寄存器具有概率正确的行为，这需要弱稳定的概念。
英文摘要：
The first self-stabilizing algorithm [Dij73] assumed the existence of a central daemon, that activates one processor at time to change state as a function of its own state and the state of a neighbor. Subsequent research has reconsidered this algorithm without the assumption of a central daemon, and under different forms of communication, such as the model of link registers. In all of these investigations, one common feature is the atomicity of communication, whether by shared variables or read/write registers. This paper weakens the atomicity assumptions for the communication model, proposing versions of [Dij73] that tolerate various weaker forms of atomicity. First, a solution for the case of regular registers is presented. Then the case of safe registers is considered, with both negative and positive results presented. The paper also presents an implementation of [Dij73] based on registers that have probabilistically correct behavior, which requires a notion of weak stabilization.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
