Self-stabilizing mutual exclusion on a ring, even if K=N

Details Self-stabilizing mutual exclusion on a ring, even if K=N Self-stabilizing mutual exclusion on a ring, even if K=N

1999-09-21

arxiv.org/abs/cs/9909013v1

Computer Science

Distributed, Parallel, and Cluster Computing

2 pages

Scientific paper

We show that, contrary to common belief, Dijkstra's self-stabilizing mutual
exclusion algorithm on a ring [Dij74,Dij82] also stabilizes when the number of
states per node is one less than the number of nodes on the ring.

Affiliated with

Also associated with

No associations

Rating

Self-stabilizing mutual exclusion on a ring, even if K=N does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Self-stabilizing mutual exclusion on a ring, even if K=N, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Self-stabilizing mutual exclusion on a ring, even if K=N will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-14892