Abstract
A self-stabilizing leader election protocol is proposed here for uniform rings of primal size. A ring of processors is said to be uniform if no distinguished leader processor exists. Having the proposed protocol as the first phase, all self-stabilizing protocols for nonuniform rings can be implemented as the second phase. Dijkstra's self-stabilizing mutual exclusion protocol for nonuniform rings is superimposed as an example on the leader election protocol. The result is a two-phase self-stabilizing mutual exclusion protocol for uniform rings. Let the size of the ring be n. Our self-stabilizing mutual exclusion protocol uses 3n states for each processor, which improves a previous result that uses approximately (n 2 /ln n) states
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
