한국정보과학회논문지:시스템및이론 (Journal of KIISE:Computer Systems and Theory)

한국정보과학회 (Korean Institute of Information Scientists and Engineers)
권호 표지

동기적 분산 시스템에서 효율적인 조정자 선출 알고리즘

An Efficient Coordinator Election Algorithm in Synchronous Distributed Systems

  • 발행 : 2004.10.01
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

결함 허용(fault-tolerant) 분산 시스템 구축 시 리더 선출(leader election)은 중요한 문제이다. 전통적인 방법으로 타임아웃에 기초한 동기적 분산 시스템을 위한 불리(Bully) 알고리즘이 있다. 본 논문에서는 타임아웃보다는 Failure Detector를 이용한 수정된 불리 알고리즘을 제시하고, 또한 전통적인 불리 알고리즘과 비교하여 수정된 불리 알고리즘의 수행 속도가 빠름을 보여주고 있다. 그 이유는 수정된 불리 알고리즘 수행 시 각 프로세스의 정상적인 작동 여부를 FD를 이용하여 빠르게 처리함으로써 처리 속도의 효율성이 높다는 점이다. 특히 다수의 프로세스들이 시스템으로 연결되어 있고, 각 프로세스에서 작동하는 프로세스들의 고장과 회복이 빈번히 발생하는 분산 시스템에서 FD를 이용하는 불리 알고리즘의 수행 속도는 전통적인 불리 알고리즘에 비해 훨씬 빠름을 보여 준다.

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.

키워드

참고문헌

  1. 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 https://doi.org/10.1145/359104.359108
  2. G. L. Peterson. 'An O(nlogn) unidirectional algorithm for circular extrima problem,' ACM Trans. Programming language and systems, Vol. 4, pp. 758-762, 1982 https://doi.org/10.1145/69622.357194
  3. 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 https://doi.org/10.1145/359024.359029
  4. 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 https://doi.org/10.1145/357195.357200
  5. G. Gafini, 'Improvement in time complexity of two message optimal algorithm,' Proc. Principles of Distributed Computing Conf., pp. 175-185, 1985
  6. 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
  7. 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 https://doi.org/10.1109/FTDCS.1992.217503
  8. H. Garcia-Molina, 'Elections in a distributed computer system. IEEE Trans. on computer, Vol 31, No.2, pp. 48-59, 1982 https://doi.org/10.1109/TC.1982.1675885
  9. 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 https://doi.org/10.1145/226643.226647
  10. 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 https://doi.org/10.1145/3149.214121
  11. Zohar Manna and Amir Pnueli. The temporal logic of reactive systems. Springer-Verlag, 1992
  12. Flaviu Cristian, 'Reaching agreement on processor group membership in Synchronous distributed systems,' Distributed Computing, Vol 4, No 4, 1991 https://doi.org/10.1007/BF01784719
  13. Flaviu Cristian and Frank Schmuck, 'Agreeing on processor group membership in asynchronous distributed systems,' Technical Report CSE95-428, University of California, San Diego, 1995
  14. 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
  15. 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
  16. David Harel, Michal Politi. Modeling Reactive System with Statecharts. McGraw-Hill, 1998