|
gptkbp:instanceOf
|
gptkb:mathematical_concept
|
|
gptkbp:alternativeName
|
FLP result
|
|
gptkbp:appliesTo
|
consensus problem
asynchronous distributed systems
|
|
gptkbp:assumes
|
possibility of process crash failure
|
|
gptkbp:author
|
gptkb:Nancy_Lynch
gptkb:Mike_Paterson
gptkb:Michael_J._Fischer
|
|
gptkbp:citation
|
gptkb:Raft_consensus_algorithm
gptkb:Paxos_algorithm
|
|
gptkbp:field
|
distributed computing
|
|
gptkbp:fullName
|
gptkb:Fischer–Lynch–Paterson_impossibility
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
FLP impossibility
|
|
gptkbp:impact
|
foundational result in distributed computing
|
|
gptkbp:influenced
|
design of fault-tolerant distributed systems
|
|
gptkbp:provenBy
|
impossibility of consensus with one faulty process in asynchronous systems
|
|
gptkbp:publicationYear
|
1985
|
|
gptkbp:publishedIn
|
gptkb:Journal_of_the_ACM
|
|
gptkbp:relatedTo
|
gptkb:CAP_theorem
gptkb:Byzantine_Generals_Problem
|
|
gptkbp:state
|
No deterministic consensus protocol is guaranteed to terminate in an asynchronous distributed system if even a single process may fail.
|
|
gptkbp:bfsParent
|
gptkb:Impossibility_of_Distributed_Consensus_with_One_Faulty_Process
|
|
gptkbp:bfsLayer
|
5
|