Data caching as a cloud service
Gregory Chockler, Guy Laden, et al.
PODC 2010
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. © 2006 Springer Science+Business Media, Inc.
Gregory Chockler, Guy Laden, et al.
PODC 2010
Gregory Chockler, Roie Melamed, et al.
PODC 2007
Gregory Chockler, Seth Gilbert, et al.
PerCom Workshops 2006
Ittai Abraham, Gregory Chockler, et al.
Information Processing Letters