Alternators on uniform rings of odd size

  title={Alternators on uniform rings of odd size},
  author={Shing-Tsaan Huang and Ying-Sung Huang and Su-Shen Hung},
  journal={Distributed Computing},
An alternator is a network of concurrent processes, which satisfies the following conditions. (1) If one process executes the critical step, no neighbor of the process executes the critical step in the same computing step. (2) Along any infinite computing steps, each process executes the critical step infinitely often. (3) An alternator is self-stabilizing to the above conditions. An alternator is said to be 1-fair if condition (2) is changed as: A process can execute the critical step twice… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


Publications citing this paper.
Showing 1-3 of 3 extracted citations

2-state alternator for uniform rings with arbitrary size

19th International Conference on Advanced Information Networking and Applications (AINA'05) Volume 1 (AINA papers) • 2005
View 8 Excerpts
Highly Influenced


Publications referenced by this paper.
Showing 1-10 of 12 references

Optimal 1-fair alternators

Inf. Process. Lett. • 2001
View 5 Excerpts

Selfstabilizing local mutual exclusion and daemon refinement

J. Beauquier, A. K. Datta, M. Gradinariu, F. Magniette
DISC’00 Proc. the 14 Int’l Symposium on Distributed Computing, • 2000
View 2 Excerpts

The alternator. Proc. the 3 Workshop on Self-stabilizing Systems (published in association with

M. G. Gouda, F. Haddix
Proc. the 19th IEEE International Conference on Distributed Computing Systems), • 1999
View 2 Excerpts

Alternating parallelism and the stabilization of distributed systems

F. Haddix
Department of Computer Sciences, the University of Texas • 1998
View 1 Excerpt

Stabilizing Phase-Clocks

Inf. Process. Lett. • 1995
View 2 Excerpts

Similar Papers

Loading similar papers…