Revisiting the election problem in asynchronous distributed systems

  • Authors:
  • SungUoon Bauk

  • Affiliations:
  • School of Electrical and Computer Engineering, Chungbuk National Unvi. Cheongju, ChungBuk, Korea

  • Venue:
  • APPT'05 Proceedings of the 6th international conference on Advanced Parallel Processing Technologies
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper is about the relationship between the Election Problem and Failure Detectors in asynchronous distributed systems. It is stated in [7] that a Perfect Failure Detector P is needed to solve the Election problem. But in contrast to the result, there is a failure detector that solves Election weaker than the Perfect Failure Detector. We introduce the Confirmatory failure detector C. We show that to solve Election, C is necessary while P is not, whereas C+$\diamondsuit$S is sufficient when a majority of the processes are correct.