Fischer–Lynch–Paterson theorem
GPTKB entity
Statements (23)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:mathematical_concept
|
| gptkbp:alsoKnownAs |
gptkb:FLP_impossibility
|
| gptkbp:appliesTo |
consensus problem
asynchronous distributed systems |
| gptkbp:assumes |
asynchronous communication
possibility of process failure |
| gptkbp:category |
impossibility result
|
| gptkbp:citation |
many distributed systems papers
|
| gptkbp:field |
distributed computing
|
| https://www.w3.org/2000/01/rdf-schema#label |
Fischer–Lynch–Paterson theorem
|
| gptkbp:impact |
foundational result in distributed computing
|
| gptkbp:namedAfter |
gptkb:Nancy_Lynch
gptkb:Michael_S._Paterson gptkb:Michael_J._Fischer |
| gptkbp:publicationYear |
1985
|
| gptkbp:publishedIn |
gptkb:Journal_of_the_ACM
|
| gptkbp:relatedTo |
gptkb:CAP_theorem
gptkb:Raft_consensus_algorithm gptkb:Byzantine_Generals_Problem gptkb:Paxos_algorithm |
| gptkbp:state |
No deterministic consensus protocol is possible in an asynchronous system with one faulty process
|
| gptkbp:bfsParent |
gptkb:Michael_J._Fischer
|
| gptkbp:bfsLayer |
6
|