35 search results - page 4 / 7 » Eventually Consistent Failure Detectors |
SIAMCOMP
2000
13 years 8 months ago
2000
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...
SAC
2009
ACM
14 years 1 months ago
2009
ACM
Experimental studies have shown that electing a leader based on measurements of the underlying communication network can be beneficial. We use this approach to study the problem ...
SRDS
2010
IEEE
13 years 6 months ago
2010
IEEE
We introduce the notion of a swift algorithm. Informally, an algorithm that solves the repeated consensus is swift if, in a partial synchronous run of this algorithm, eventually no...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Spinnaker is an experimental datastore that is designed to run on a large cluster of commodity servers in a single datacenter. It features key-based range partitioning, 3-way repl...
MASCOTS
1993
13 years 10 months ago
1993
: Weak-consistency replication protocols can be used to build wide-area services that are scalable, fault-tolerant, and useful for mobile computer systems. We have evaluated the ti...