Share on Facebook Tweet on Twitter Share on LinkedIn Share by email
Light-Weight Leases for Storage-Centric Coordination

Gregory Chockler and Dahlia Malkhi


Reaching agreement among processes sharing read/write memory is possible only in the presence of an eventual unique leader. A leader that fails must be recoverable, but on the other hand, a live and well-performing leader should never be decrowned. This paper presents the first leader algorithm in shared memory environments that guarantees an eventual leader following global stabilization time. The construction is built using light-weight lease and renew primitives. The implementation is simple, yet efficient. It is uniform, in the sense that the number of potentially contending processes for leadership is not a priori known.


Publication typeArticle
Published inInternational Journal of Parallel Programming
PublisherSpringer Verlag
> Publications > Light-Weight Leases for Storage-Centric Coordination