Fault-Tolerant Parallel Computation
E1377986
UNEXPLORED
Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Fault-Tolerant Parallel Computation canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19494844 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Fault-Tolerant Parallel Computation Context triple: [Paris C. Kanellakis, coAuthorOf, Fault-Tolerant Parallel Computation]
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
C.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
D.
BBN Butterfly parallel computer
The BBN Butterfly parallel computer was an early massively parallel processing system notable for its scalable architecture and use in advanced research and defense applications in the 1980s.
-
E.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Fault-Tolerant Parallel Computation Target entity description: Fault-Tolerant Parallel Computation is a scholarly work in computer science that studies how to design and analyze parallel algorithms and systems that continue to operate correctly despite hardware or process failures.
-
A.
Elements of Distributed Algorithms
Elements of Distributed Algorithms is a foundational textbook that systematically presents the principles, models, and key techniques used in the design and analysis of distributed algorithms.
-
B.
"Reaching Agreement in the Presence of Faults"
"Reaching Agreement in the Presence of Faults" is a seminal paper in distributed computing that introduced the Byzantine Generals Problem and laid the foundations for understanding consensus in unreliable, fault-prone systems.
-
C.
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs"
"How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs" is a seminal paper by Leslie Lamport that introduced foundational concepts for ensuring correctness and consistency in concurrent and multiprocessor systems.
-
D.
BBN Butterfly parallel computer
The BBN Butterfly parallel computer was an early massively parallel processing system notable for its scalable architecture and use in advanced research and defense applications in the 1980s.
-
E.
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms is a classic computer science textbook that systematically presents fundamental techniques and theoretical foundations for designing and analyzing efficient algorithms.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.