The Minimum Requirements for Solving Election Problem in Asynchronous Distributed Systems


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 7, No. 12, pp. 3815-3820, Dec. 2000
10.3745/KIPSTE.2000.7.12.3815,   PDF Download:

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.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. H. Park, "The Minimum Requirements for Solving Election Problem in Asynchronous Distributed Systems," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 7, no. 12, pp. 3815-3820, 2000. DOI: 10.3745/KIPSTE.2000.7.12.3815.

[ACM Style]
Sung Hoon Park. 2000. The Minimum Requirements for Solving Election Problem in Asynchronous Distributed Systems. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 7, 12, (2000), 3815-3820. DOI: 10.3745/KIPSTE.2000.7.12.3815.