Leader election: From Higham-Przytycka's algorithm to a gracefully degrading algorithm

Proceedings - 2012 6th International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS 2012

Volumn , Issue , 2012, Pages 225-232

  Arrieta, Itziar ^a   Fariña, Federico ^a   De Mendívil, José Ramón G ^a   Raynal, Michel ^b  

^a PUBLIC UNIVERSITY OF NAVARRE   (Spain)

^b INSTITUT UNIVERSITAIRE DE FRANCE   (France)

Author keywords

Asynchronous system; Deterministic algorithm; Distributed algorithm; Fault tolerance; Initial value fault; Leader Election; Message complexity; Round number

Indexed keywords

ASYNCHRONOUS SYSTEM; DETERMINISTIC ALGORITHMS; INITIAL VALUES; LEADER ELECTION; MESSAGE COMPLEXITY; ROUND NUMBER;

FAULT TOLERANCE; PARALLEL ALGORITHMS;

ALGORITHMS;

EID: 84866603372     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISIS.2012.65     Document Type: Conference Paper

References (13)

1. Angluin D., Local and Global Properties in Networks of Processors. Proc. 12th ACM Symposium on Theory of Computation (STOC'81), ACM Press, pp. 82-93, 1981.
2. Attiya H., Snir M. and Warmuth M., Computing on an Anonymous Ring. Journal of the ACM, 35(4):845-876, 1988.
3. Attiya H. and Welch J., Distributed Computing: Fundamentals, Simulations and Advanced Topics (2d Edition). Wiley-Interscience, 414 pages, 2004.
4. Bodlaender H.L., Some Lower Bound Results for Decentralized Extrema Finding in Ring of Processors. Journal of Computer System Science, 42:97-118, 1991.
5. Chang E.J.H. and Roberts R., An Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of processes. Communications of the ACM, 22(5):281-283, 1979.
6. Dolev D., Klawe M. and Rodeh M., An O(n log n) Unidirectional Algorithm for Extrema Finding in a Circle. Journal of Algorithms, 3:245-260, 1982.
7. Higham L. and Przytycka T., A Simple Efficient Algorithm for Maximum Finding on Rings. Information Processing Letters, 58:319-324, 1996.
8. Hirschberg D.S. and Sinclair J.B., Decentralized Extrema Finding in Circular Configuration of Processors. Communications of the ACM, 23:627-28, 1980.
9. Le Lann G., Distributed Systems: Towards a Formal Approach. IFIP World Congress, pp. 155-160, 1977.
10. Peterson G.L., An O(n log n) Unidirectional Algorithm for the Circular Extrema Finding. ACM Transactions on Programming Languages and Systems, 4(4):758-762, 1982.
11. Raynal M., Algorithms for Mutual Exclusion. The MIT Press, 107 pages, 1986.
12. Raynal M., Communication and Agreement Abstractions for Fault-Tolerant Distributed Systems. Morgan & Claypool Publishers, 265 pages, 2010, ISBN 978-1-60845-293-4.
13. Santoro N., Design and Analysis of Distributed Algorithms. Wiley-Interscience, 509 pages, 2007.