Self-stabilizing multi-token rings

@article{Flatebo1995SelfstabilizingMR,
  title={Self-stabilizing multi-token rings},
  author={Mitchell Flatebo and Ajoy Kumar Datta and Anneke A. Schoone},
  journal={Distributed Computing},
  year={1995},
  volume={8},
  pages={133-142}
}
A distributed system consists of a set of loosely connected machines that do not share a global memory. The system isself-stabilizing if it can be started in any global state and achieves consistency all by itself. This also means that the system can deal withinfrequent errors. This paper presents self-stabilizing multi-token rings. A multitoken ring is a generalization of a (one-)token ring. The algorithms presented are generalizations of a self-stabilizing mutual exclusion algorithm by… CONTINUE READING

From This Paper

Topics from this paper.

References

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

Self-stabilizing l-exclusion algorithms

  • M Flatebo, AK Datta, AA Schoone
  • Tech Rep RUU-CS-93-01,
  • 1993
1 Excerpt

Observations on l-exclusion

  • G Peterson
  • 28th Annual Allerton Conference on Communication…
  • 1990
1 Excerpt

On relaxing interleaving assumptions

  • M Burns J. Gouda, R Miller
  • MCC Workshop on Self-Stabilization
  • 1989
1 Excerpt

Similar Papers

Loading similar papers…