Anaïs Durand

Learn More
In this paper, we propose a silent self-stabilizing leader election algorithm for bidirectional connected identified networks of arbitrary topology. This algorithm is written in the locally shared memory model. It assumes the distributed unfair daemon, the most general scheduling hypothesis of the model. Our algorithm requires no global knowledge on the(More)
A distributed algorithm is snap-stabilizing if it enables a distributed system to resume a correct behavior immediately after transient faults place it in some arbitrary state. In this paper, we propose two probabilistic snap-stabilizing algorithms to solve the local mutual exclusion problem and their generalizations to some other local resource allocation(More)
  • 1