158
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
In the Byzantine agreement problem, a set of n processors, any f of whom may be arbitrarily faulty, must reach agreement on a value proposed by one of the correct processors. It i...
214
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and we study models of computing that are weaker ve...
176
click to vote
PODC
2012
ACM
13 years 8 months ago
2012
ACM
Failure detectors — oracles that provide information about process crashes — are an important ion for crash tolerance in distributed systems. Although current failure-detector...
157
Voted
PODC
2012
ACM
13 years 8 months ago
2012
ACM
Two new algorithms are given for randomized consensus in a shared-memory model with an oblivious adversary. Each is based on a new construction of a conciliator, an object that gu...
204
click to vote
SIGMETRICS
2012
ACM
13 years 8 months ago
2012
ACM
This paper presents a benchmarking suite that measures the performance of using sockets and eXtensible Markup Language remote procedure calls (XML-RPC) to exchange intra-node mess...