42 search results - page 9 / 9 » The Weakest Failure Detector for Solving Consensus |
SAC
2010
ACM
14 years 2 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
IPPS
2009
IEEE
14 years 2 months ago
2009
IEEE
In this paper we define the Weak Mutual Exclusion (WME) problem. Analogously to classical Distributed Mutual Exclusion (DME), WME serializes the accesses to a shared resource. Di...