Eventual Leader Election with Weak Assumptions on Initial Knowledge, Communication Reliability, and Synchrony

ISSN： 1000-9000

Source： Journal of Computer Science and Technology, Vol.25, Iss.6, 2010-11, pp. : 1267-1281

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On implementing omega in systems with weak reliability and synchrony assumptions

By Aguilera Marcos

Distributed Computing, Vol. 21, Iss. 4, 2008-10 ,pp. : 285-314

Springer Publishing Company

Access to resources Recommend Favorite

Specifying and implementing an eventual leader service for dynamic systems

By Larrea Mikel Raynal Michel Soraluze Iratxe Cortiñas Roberto

International Journal of Web and Grid Services, Vol. 8, Iss. 3, 2012-09 ,pp. : 204-224

Inderscience Publishers

Access to resources Recommend Favorite

Randomized leader election

By Ramanathan Murali Ferreira Ronaldo Jagannathan Suresh Grama Ananth Szpankowski Wojciech

Distributed Computing, Vol. 19, Iss. 5-6, 2007-04 ,pp. : 403-418

Springer Publishing Company

Access to resources Recommend Favorite

Formal verification of a leader election protocol in process algebra

By Fredlund L.-a. Groote J.F. Korver H.

Theoretical Computer Science, Vol. 177, Iss. 2, 1997-05 ,pp. : 459-486

Elsevier

Access to resources Recommend Favorite

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

By Antonoiu G. Srimani P.K.

Journal of Parallel and Distributed Computing, Vol. 34, Iss. 2, 1996-05 ,pp. : 227-232

Academic Press

Access to resources Recommend Favorite