The Transactions of the Korea Information Processing Society (한국정보처리학회논문지)

Korea Information Processing Society (한국정보처리학회)
권호 표지

The Minimum Requirements for Solving Election Problem in Asynchronous Distributed Systems

비동기적 분산 시스템하에서 선출 문제 해결을 위한 최소 필요 조건

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

Abstract

This paper is about the minimum requirements to solve the Election problem in asynchronous distributed systems. The focus of the paper is to find out what failure detector is the weakest one to solve the Election problem. We first discuss the relationship between the Election problem and the Consensus problem in asynchronous distributed systems with unreliable failure detectors and show that the Election problem is harder than the Consensus problem. More precisely, the weakest failure detector that is needed to solve this problem is a Perfect Failure Detector. which is strictly stronger than the weakest failure detector that is needed to solve Consensus.

본 논문에서는 비동기적 분산 시스템에서 산출(Election) 문제를 해결하는데 필요한 최소한의 조건에 대해 논하고자 한다. 이 논문의 핵심은 비동기적 분산 시스템에서 산출 문제를 해결하는데 가장 약한 고장 추적장치는 무엇인가를 찾아내는 데 있다. 먼저 비동기적 분산 시스템에서 산출 문제와 합의(Consensus)문제에 대한 관련성을 토의하고 선출 문제는 합의 문제보다 더욱 어려운 문제임을 보인다. 보다 엄밀하게 표현하자면, 선출 문제를 해결하는데 필요한 가장 약한 고장 추적 장치는 완전한 고장 추적 장치이어야 하는 것으로, 이는 합의 문제를 해결하는데 필요한 가장 약한 고장 추적 장치보다 확실히 강한 것이다.

Keywords

References

  1. G. LeLann, 'Distributed systemstowards a formal approach, Information Processing 77,' B. Gilchrist, Ed. NorthHolland, 1977
  2. H. Garcia-Molian, 'Elections in a distributed computing system, IEEE Transactions on Computers,' Vol.31, No.1, pp.49-59, 1982 https://doi.org/10.1109/TC.1982.1675885
  3. H. Abu-Amara and J. Lokre, 'Election in asynchronous complete networks with intermittent link failures,' IEEE Transactions on Computers, Vol.43, No.7, pp.778-788, 1994 https://doi.org/10.1109/12.293257
  4. H. M. Sayeed, M. Abu-Amara and H. Abu-Avara, 'Optimal asynchronous agreement and leader election algorithm for complete networks with byzantine faulty links,' Distributed Computing, Vol.9, No.3, pp.147-156, 1995 https://doi.org/10.1007/s004460050016
  5. J. Brunekreef, J. P. Katoen, R. Koymans and S. Mauw, 'Design and analysis of dynamic leader election protocols in broadcast networks,' Distributed Computing, Vol.9, No.4, pp.157-171, 1996 https://doi.org/10.1007/s004460050017
  6. G. Singh, 'Leader election in the presence of link failures,' IEEE Transactions on Parallel and Distributed Systems, Vol.7, No.3, pp.231-236, March 1996 https://doi.org/10.1109/71.491576
  7. M. Fischer, N. Lynch, and M. Paterson, 'Impossibility of Distributed Consensus with One Faulty Process,' Journal of the ACM, Vol.32, No.1, pp.374-382, 1985 https://doi.org/10.1145/3149.214121
  8. T. Chandra and S. Toueg, 'Unreliable failure detectors for reliable distributed systems,' Technical Report, Department of computer Science, Cornell Univ., 1994
  9. D. Doleb and R Strong, 'A Simple Model For Agreement in Distributed Systems,' In Fault-Tolerant Distributed computing, B. Simons and A. Spector ed, Springer Verlag (LNCS 448), pp.42-59, 1987
  10. 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, ACM press, pp.147-158, 1992 https://doi.org/10.1145/135419.135451
  11. R. Guerraoui and A. Schiper, 'Transaction model vs Virtual Synchrony model : bridging the gap,' In Distributed Systems: From Theory to Practice, K. Birman, F. Mattern and A. Schiper ed, Springer Verlag (LNCS 938), pp.121-132, 1995 https://doi.org/10.1007/3-540-60042-6_9
  12. V. Hadzilacos, 'On the relationship between the atomic commitment and consensus problems,' In Fault-Tolerant Distributed Computing, B. Simons and A. spector ed, Springer Verlag (LNCS 448), pp.201-208, 1987
  13. L. Sabel and K. Marzullo, 'Election vs. Consensus in Asynchronous Systems,' Technical Report TR95-1488, cornell Univ, 1995
  14. A. Schiper and A. Sandoz, 'Primary Partition Virtually-Synchronous Communication harder than consensus,' In Proceedings of the 8th Workshop on Distributed Algorithms, 1994
  15. Rachid Guerraoui, 'Revisiting the relationship between non-blocking atomic commitment and consensus,' In Proceedings of the 10th International Workshop on Distributed Algorithms, Springer Verlag (LNCS 857), 1996
  16. P. A. Bernstein, V. Hadzilacos, and N. Goodman, 'Concurrency Control and Recovery in Database Systems,' Addison Wesley, 1987