In an asynchronous system where one process may crash, which two properties can no deterministic algorithm both guarantee?
What model does the FLP impossibility result for consensus assume?
With no bound on message delay, a slow process and a crashed process can always be told apart.
Circle one: True False
What is a timeout standing in for?
A node waits for a reply that never comes. What is the dilemma?
A timeout fires on a node that was merely slow. What went wrong?
Your system must keep agreeing despite slow networks. Which concession fits?
A vendor's tests never saw its deterministic consensus algorithm fail, so it promises guaranteed agreement and guaranteed finish under asynchrony with one possible crash. How do you answer?