Computers and Mathematics with Applications Quasi-self-stabilization of a Distributed System Assuming Read/write Atomicity
Computers and Mathematics with Applications Quasi-self-stabilization of a Distributed System Assuming Read/write Atomicity
复制标题
计算机和数学及其应用假设读/写原子性的分布式系统的准自稳定
DOI：
--
复制
发表时间：
--
期刊：
影响因子：
--
通讯作者：
Nathan Mou
中科院分区：
文献类型：
--
作者：
Ji;T. C. Huang;Cheng;Nathan Mou
Dolev 型自稳定系统首先由 Dolev 等人提出。在他们 1993 年的著名论文中。与 Dijkstra 类型的自稳定系统相比，这种自稳定系统采用读/写原子性模型而不是复合原子性模型。在本文中，我们介绍了多列夫型准自稳定系统的概念。采用 Dijkstra 的 K 状态互斥算法的自然适应版本来说明新概念。如果 K 大于或等于 2n−1，则自适应算法是自稳定的；如果 K 小于 2n−1 但大于或等于 n，则自适应算法是准自稳定的，但不是自稳定的；如果 K 小于 n，则不是准自稳定的。
Self-stabilizing systems of the Dolev type were first introduced by Dolev et al. in their famous paper in 1993. In contrast to self-stabilizing systems of the Dijkstra type, such self-stabilizing systems assume the read/write atomicity model instead of the composite atomicity model. In this paper, we introduce the notion of quasi-self-stabilizing systems of the Dolev type. A naturally-adapted version from Dijkstra's K-state mutual exclusion algorithm is employed to illustrate the new notion. The adapted algorithm is shown to be self-stabilizing if K is greater than or equal to 2n − 1, quasi-self-stabilizing but not self-stabilizing if K is less than 2n−1 but greater than or equal to n, and not quasi-self-stabilizing if K is less than n.