한국콘텐츠학회논문지 (The Journal of the Korea Contents Association)

  • 제8권2호
  • /
  • Pages.9-17
  • /
  • 2008
  • /
  • 1598-4877(pISSN)
  • /
  • 2508-6723(eISSN)
한국콘텐츠학회 (The Korea Contents Association)
권호 표지
DOI QR코드

DOI QR Code

분산 시스템에서 고장 추적 장치를 이용한 선출 알고리즘

An Election Algorithm with Failure Detectors in Distributed Systems

  • 박성훈 (충북대학교 전기전자컴퓨터공학부)
  • 발행 : 2008.02.28
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

본 논문에서는 동기적인 분산시스템에서 불리 알고리즘에 기초하여 하나의 새로운 선출(election) 알고리즘을 설계하고 이를 분석하고자 한다. 동기적인 분산시스템에서 기존의 불리 알고리즘은 고장 추적 장치를 이용하여 더욱 효율적으로 설계되고 구현 될 수 있음을 보인다.

Tn this paper, we design and analyze an election algorithm, based on the Bully algorithm, in synchronous distributed systems. We show that the Bully algorithm, when using Failure Detector, is more effectively implemented than the classic Bully algorithm for synchronous distributed systems.

키워드

참고문헌

  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. N. 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. G. Molian, "Elections in a distributed computing system," IEEE Transactions on Computers, Vol.C-31, No.1, pp.49-59, 1982. https://doi.org/10.1109/TC.1982.1675885
  9. D. C. Tushar and T. Sam, "Unreliable failure detectors for reliable distributed systems," Journal of ACM, Vol.43, No.2, pp.225-267, 1996. https://doi.org/10.1145/226643.226647
  10. V. Hadzilacos and S. Toueg, "B. Reliable and Related Problems," In Distributed Systems (Second Edition), ACM Press, New York, pp.97-145, 1993.
  11. D. Shlomi, I. Amos, and M. Shlomo, "Uniform dynamic self-stablizing leader election," In Sam Toueg, Paul G. Spirakis, and K. Lefteris, Proc. 5th International Workshop on distributed Algorithms(WDAG '91), of Lecture Notes in Computer Science, Vol.579, pp.167-180, 1991.
  12. I. Gene, L. Chengdian, and S. Janos, "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, pp.288-302, 1995.
  13. G. Rachid, "On the hardness of failuresensitive agreement problems," Information Processing Letter, Vol.79, No.2, pp.99-104, 2001. https://doi.org/10.1016/S0020-0190(00)00171-X
  14. A. Mostefaoui, E. Mourgaya, and M. Raynal, "Asynchronous Implementation of Failure Detectors," Proc. Int. IEEE Conference on Dependable Systems and Networks(DSN'03), IEEE Computer Press, San Francisco(CA), pp.351-360, 2003. https://doi.org/10.1109/DSN.2003.1209946