Sciweavers

8 search results - page 2 / 2
» The Weakest Failure Detector for Eventual Consistency
Sort
View
WDAG
2010
Springer
218views Algorithms» more  WDAG 2010»
13 years 3 months ago
Anonymous Asynchronous Systems: The Case of Failure Detectors
Abstract: Due the multiplicity of loci of control, a main issue distributed systems have to cope with lies in the uncertainty on the system state created by the adversaries that ar...
François Bonnet, Michel Raynal
SIAMCOMP
2000
74views more  SIAMCOMP 2000»
13 years 5 months ago
On Quiescent Reliable Communication
We study the problem of achieving reliable communication with quiescent algorithms (i.e., algorithms that eventually stop sending messages) in asynchronous systems with process cra...
Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg
OPODIS
2007
13 years 6 months ago
Byzantine Consensus with Few Synchronous Links
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
Moumen Hamouma, Achour Mostéfaoui, Gilles T...