Browse > Article

An Efficient Coordinator Election Algorithm in Synchronous Distributed Systems  

박성훈 (충북대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.31, no.10, 2004 , pp. 553-561 More about this Journal
Abstract
Leader election is an important problem in developing fault-tolerant distributed systems. As a classic solution for leader election, there is Garcia-Molina's Bully Algorithm based on time-outs in synchronous systems. In this paper, we re-write the Bully Algorithm to use a failure detector instead of explicit time-outs. We show that this algorithm is more efficient than the Garcia-Molina's one in terms of the processing time. That is because the Bully_FD uses FD to know whether the process is up or down so fast and it speed up its execution time. Especially, where many processes are connected in the system and crash and recovery of processes are frequent, the Bully_FD algorithm is much more efficient than the classical Bully algorithm in terms of the processing time.
Keywords
Election; Synchronous Distributed Systems; Failure Detectors;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Shlomi Dolev, Amos Israeli, and Shlomo Morgan. 'Uniform dynamic self-stabilizing leader election,' In Sam Toueg, Paul G. Spirakis, and Lefteris Kirousis, editors, Proc. 5th International Workshop on distributed Algorithms(WDAG '91), Vol. 579 of Lecture Notes in Computer Science, pp. 167-180. Springer-Verlag, 1991
2 Gene Itkis, Chengdian Lin, and Janos Simon. 'Deterministic, constant space, self-stabilizing leader election on uniform rings,' In Jean-Michel Helary and Michel Raynal, editors, Proc, 9th International Workshop on Distributed Algorithms (WDAG '95), Vol. 972 of Lecture Notes in Computer Science, pp. 288-302. Springer-Verlag, 1995
3 David Harel, Michal Politi. Modeling Reactive System with Statecharts. McGraw-Hill, 1998
4 Michal J Fisher, Nancy A. Lynch, and Michael S. Paterson, 'Impossibility of distributed consensus with one fault process,' Journal of the ACM, Vol 32, No 2, pp. 374-382, April 1985   DOI   ScienceOn
5 Zohar Manna and Amir Pnueli. The temporal logic of reactive systems. Springer-Verlag, 1992
6 Flaviu Cristian, 'Reaching agreement on processor group membership in Synchronous distributed systems,' Distributed Computing, Vol 4, No 4, 1991   DOI
7 Flaviu Cristian and Frank Schmuck, 'Agreeing on processor group membership in asynchronous distributed systems,' Technical Report CSE95-428, University of California, San Diego, 1995
8 Tushar Deeppak Chandra and Sam Toueg, 'Unreliable failure detectors for reliable distributed systems,' Journal of ACM, Vol. 43, No.2, pp. 225-267, March 1996   DOI   ScienceOn
9 R. Chow, K. Luo, and R. Newman-Wolfe. 'An optimal distributed algorithm for failure driven leader election in bounded-degree networks,' Proc. IEEE Workshop on Future Trends of Distributed Computing Systems, pp. 136-141, 1992   DOI
10 H. Garcia-Molina, 'Elections in a distributed computer system. IEEE Trans. on computer, Vol 31, No.2, pp. 48-59, 1982   DOI   ScienceOn
11 E. J. Chang and R. Roberts, 'An improved algorithm for the decentralized extrima-finding in circular configurations of processes,' Communication of ACM, Vol. 22, No.5, pp. 281-283, 1979   DOI   ScienceOn
12 G. L. Peterson. 'An O(nlogn) unidirectional algorithm for circular extrima problem,' ACM Trans. Programming language and systems, Vol. 4, pp. 758-762, 1982   DOI
13 D. S. Hirshberg and J. B. Sinclair. 'Decentralized extrima finding in circular configurations of Processors,' Communications of the ACM, Vol. 23, No. 11, pp. 627-628, 1980   DOI
14 R. Gallager, P. Humblet and P. Spira, 'A distributed algorithm for minimum weighted spanning trees,' ACM trans. On Programming language and Systems, Vol. 5, No 1, pp. 66-77, 1983   DOI
15 G. Gafini, 'Improvement in time complexity of two message optimal algorithm,' Proc. Principles of Distributed Computing Conf., pp. 175-185, 1985
16 F. Chin and H. F. Ting, 'An almost linear time and O(nlogn-e) message distributed algorithm for minimum weighted spanning trees,' Proc. Foundations of Computer Science Conf., pp. 257-166, 1985