Different Perspectives on FLP Impossibility
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2022
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910801857609728 |
|---|---|
| author | Klianev, Ivan |
| author_facet | Klianev, Ivan |
| contents | We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary agreement - in complete asynchrony and a possible process crash - in two steps. First, we introduce a new paradigm for consensus termination and show that impossibility of agreement is not evidence for impossibility to terminate. Next, we present a consensus algorithm that ensures termination with agreement about the initial input from the processes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2210_02695 |
| institution | arXiv |
| publishDate | 2022 |
| record_format | arxiv |
| spellingShingle | Different Perspectives on FLP Impossibility Klianev, Ivan Distributed, Parallel, and Cluster Computing We demonstrate termination of binary consensus under the model and conditions used by Fischer, Lynch, and Patterson (FLP) to prove impossibility of binary agreement - in complete asynchrony and a possible process crash - in two steps. First, we introduce a new paradigm for consensus termination and show that impossibility of agreement is not evidence for impossibility to terminate. Next, we present a consensus algorithm that ensures termination with agreement about the initial input from the processes. |
| title | Different Perspectives on FLP Impossibility |
| topic | Distributed, Parallel, and Cluster Computing |
| url | https://arxiv.org/abs/2210.02695 |