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

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

Proof that the Election Problem belongs to NF-completeness Problems in Asynchronous Distributed Systems

비동기적 분산 시스템에서 선출 문제는 NF-completeness 문제임을 증명

  • 박성훈 (남서울대학교 컴퓨터학과)
  • Published : 2002.04.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper is about the hardness of the Election problem in asynchronous distributed systems in which processes can crash but links are reliable. The hardness of the problem is defined with respect to the difficulty to solve it despite failures. It is shown that problems encountered in the system are classified as three classes of problems: F (fault-tolerant), NF (Not fault-tolerant) and NFC(NF-completeness). Among those, the class NFC is the hardest problems to solve. In this paper, we prove that the Election problem is the most difficult problem which belongs to the class NFC.

본 논문은 프로세스들이 크래시(crash)되어 죽을 수 있으나 통신망은 신뢰 할 수 있는 비동기적 분산 시스템에서 선출(election) 문제 해결의 어려움에 대하여 논한 글이다. 비동기적인 분산 시스템에서 문제들을 해결하는데 어려움의 정도는 프로세스들의 실패(failure)에도 불구하고 그것들을 해결 할 수 있느냐 하는 어려움(difficulty)에 의해 결정된다. 비동기적인 분산 시스템에서 부딪치는 문제들은 3부류의 문제들로 구분되는 바: F(고장 감내), NF(비고장 감내), NFC(비고장 감내 완전성)의 3 종류들이다. 그런 문제들 중, NFC 부류의 문제들이 해결하기 가장 어려운 문제들이다. 본 논문에서는 선출 문제도 NFC 부류에 속하는 해결하기 가장 어려운 문제임을 증명한다.

Keywords

References

  1. Fischer M.J., Lynch N. and Paterson M.S, Impossibility of Distributed Consensus with One Faulty Process, Journal of the ACM, 32(2):374-382, April 1985 https://doi.org/10.1145/3149.214121
  2. Eddy Fromentin, Michel R RAY, Frederic TRONEL, On Classes of Problems in Asynchronous Distributed Systems, In Proceedings of Distributed Computing Conference, IEEE 10.4, June 1999 https://doi.org/10.1109/ICDCS.1999.776549
  3. L. Sabel and K. Marzullo, Simulating fail-stop in asynchronous distributed systems, In proceedings of the Thirteenth Symposium on Reliable Distributed Systems, pages 138-147, IEEE, Oct. 1994 https://doi.org/10.1109/RELDIS.1994.336901
  4. T. Chandra., V. Hadzilacos and S. Toueg, The Weakest Failure Detector for Solving Consensus, Proceedings of the 11th ACM Symposium on Principles of Distributed Computing, pp. 147-158, ACM press, 1992 https://doi.org/10.1145/135419.135451
  5. Chandra T. and Toueg S., Unreliable Failure Detectors for Reliable Distributed Systems, Journal of the ACM, 43(1):225-267, March 1996 https://doi.org/10.1145/226643.226647
  6. Guerraoui R, Revisiting the Relationship Between Non-Blocking Atomic Commitment and Consensus, Proc. of the 9th Int. Workshop on Distributed Algorithms(WDAG), Springer-Verlag, LNCS 972, pp. 87-100, September 1995 https://doi.org/10.1007/BFb0022140
  7. Hadzilacos V. and Toueg S. Reliable Broadcast and Related Problems, In Distributed Systems(Second Edition), ACM Press, New York, pp.97-145, 1993
  8. Garey M.R. and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman W.H & Co, New York, 340 pages, 1979
  9. Hopcroft J.E. and Ullman J.D. Introduction to Automata Theory, Languages and Computation, Addison Wesley, Reading, Mass., 418 pages, 1979
  10. David Powell, guest editor. Special section on group communication, Communications of the ACM, 39(4):50-97, April 1996 https://doi.org/10.1145/227210.227225
  11. N. Budgiraja, K. Marzullo F.B.Schneider, and S. Toueg, Primary-backup protocols: lower bounds and optimal implementations, In Proceedings of the Third IFIP Working Conference on Dependable Computing for Critical Applications. IFIP 10.4, September 1992