Skip to main content
Log in

Self-stabilizing \(2^m\)-clock for unidirectional rings of odd size

  • Original article
  • Published:
Distributed Computing Aims and scope Submit manuscript

Summary.

In this paper, we propose a self-stabilizing K-clock protocol for unidirectional rings with odd size, where \(K = 2^m\) 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{\scriptstyle \bullet} n^2\)), where n is the ring size.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: July 1998 / Accepted: January 1999

Rights and permissions

Reprints and permissions

About this article

Cite this article

Huang, ST., Liu, TJ. Self-stabilizing \(2^m\)-clock for unidirectional rings of odd size. Distrib Comput 12, 41–46 (1999). https://doi.org/10.1007/s004460050054

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s004460050054

Navigation