Quasi-self-stabilization of a distributed system assuming read/write atomicity

Authors:
Ji-Cherng Lin;Tetz C. Huang;Cheng-Zen Yang;Nathan Mou
Affiliations:
Department of Computer Science and Engineering, Yuan-Ze University, Taiwan, ROC;Department of Computer Science and Engineering, Yuan-Ze University, Taiwan, ROC;Department of Computer Science and Engineering, Yuan-Ze University, Taiwan, ROC;Department of Computer Science and Engineering, Yuan-Ze University, Taiwan, ROC
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 9
Cited 2

A belated proof of self-stabilization

Distributed Computing
Self-stabilizing depth-first search

Information Processing Letters
Self-stabilization

Self-stabilization
Self-stabilizing systems in spite of distributed control

Communications of the ACM
1983 Invited address solved problems, unsolved problems and non-problems in concurrency

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization
A self-stabilizing algorithm for the shortest path problem assuming read/write atomicity

Journal of Computer and System Sciences
A self-stabilizing algorithm for the shortest path problem assuming the distributed demon

Computers & Mathematics with Applications
A self-stabilizing algorithm for the center-finding problem assuming read/write separate atomicity

Computers & Mathematics with Applications

Loosely-Stabilizing leader election in population protocol model

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Loosely-stabilizing leader election in a population protocol model

Theoretical Computer Science

Quantified Score

Hi-index	0.09

Visualization

Abstract

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.