30 search results - page 5 / 6 » The weakest failure detectors to solve certain fundamental p... |
PODC
2009
ACM
14 years 8 months ago
2009
ACM
d Abstract] Marcos K. Aguilera Microsoft Research Silicon Valley Mountain View, CA, USA Carole Delporte-Gallet Universit? Paris 7 Paris, France Hugues Fauconnier Universit? Paris ...
ICDCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We prove two theorems saying that no distributed system in which processes coordinate using reliable registers and -resilient services can solve the consensus problem in the prese...
ICPP
2009
IEEE
14 years 2 months ago
2009
IEEE
—P2P storage systems use replication to provide a certain level of availability. While the system must generate new replicas to replace replicas lost to permanent failures, it ca...
DSN
2002
IEEE
14 years 13 days ago
2002
IEEE
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done ...
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...