Deterministic silence and self stabilizing leader election algorithm on id based ring
نویسنده
چکیده
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader election silent algorithm memory space
منابع مشابه
Deterministic silence and self stabilizing leader election algorithm on id based rings
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have bound on their id values The id values of processors in a ring whose size is N have to be inferior to N k The size of commu nication registers required by the algorithm is constant The algorithm stabilizes in k N time In DGS Dolev Gouda and Schneider have e...
متن کاملA Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings
A new, self-stabilizing algorithm for electing a leader on a unidirectional ring of prime size is presented for the composite atomicity model with a centralized daemon. Its space complexity is optimal to within a small additive constant number of bits per processor, significantly improving previous self-stabilizing algorithms for this problem. In other models or when the ring size is composite,...
متن کاملCompact Deterministic Self-stabilizing Leader Election - The Exponential Advantage of Being Talkative
This paper focuses on compact deterministic self-stabilizing solutions for the leader election problem. When the protocol is required to be silent (i.e., when communication content remains fixed from some point in time during any execution), there exists a lower bound of Ω(log n) bits of memory per node participating to the leader election (where n denotes the number of nodes in the system). Th...
متن کاملDeterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and th...
متن کاملDeterministic , Constant Space , Self - Stabilizing Leader Electionon Uniform
We consider the problem of electing a leader on a ring of nameless processors by de-terministic and self-stabilizing protocols. A processor can read the state of its neighbors (and its own state) to determine if it is enabled. A central demon (scheduler) picks an enabled processor to make an atomic move. In an atomic move, the processor changes to a new state which is a function of its old stat...
متن کامل