Self-stabilizing 2m-clock for unidirectional rings of odd size

Authors:
Shing-Tsaan Huang;Tzong-Jye Liu
Affiliations:
Department of Computer Science, National Tsing Hua University, Hsin Chu, Taiwan, 30043 R.O.C.;Department of Computer Science, National Tsing Hua University, Hsin Chu, Taiwan, 30043 R.O.C.
Venue:
Distributed Computing
Year:
1999

Citing 8
Cited 3

Uniform self-stabilizing rings

ACM Transactions on Programming Languages and Systems (TOPLAS)
Stabilizing unison

Information Processing Letters
Memory-efficient self stabilizing protocols for general networks

Proceedings of the 4th international workshop on Distributed algorithms
Stabilizing phase-clocks

Information Processing Letters
The stabilizing token ring in three bits

Journal of Parallel and Distributed Computing
Four-state stabilizing phase clock for unidirectional rings of odd size

Information Processing Letters
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Two-State Self-Stabilizing Algorithms for Token Rings

IEEE Transactions on Software Engineering

Alternators on uniform rings of odd size

Distributed Computing
A Time-Optimal Self-Stabilizing Synchronizer Using A Phase Clock

IEEE Transactions on Dependable and Secure Computing
Self-stabilizing asynchronous phase synchronization in general graphs

SSS'06 Proceedings of the 8th international conference on Stabilization, safety, and security of distributed systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a self-stabilizing K- clock protocol for unidirectional rings with odd size, where K = 2m and m is any positive integer. Besides the variable for maintaining the clock, the proposed protocol only requires one additional bit. The worst-case stabilizing time is O(Kċn2), where n is the ring size.