Loading...
report
Failure Detection Lower Bounds on Registers and Consensus (Preliminary Version)
2002
This paper addresses the problem of determining the weakest failure detector to implement consensus in a message passing system when t out of n processes can crash (including when n/2 =< t < n-1), by addressing the problem of determining the weakest failure detector to implement a register. We complement and, in a precise sense, generalise previous results on the implementability of consensus and registers in a message passing model (augmented with the failure detector abstraction).
Loading...
Name
IC_TECH_REPORT_200230.pdf
Access type
openaccess
Size
303.29 KB
Format
Adobe PDF
Checksum (MD5)
6ae792caf51fd13c96b426c6865d4c24