Sciweavers

356 search results - page 3 / 72
» Revisiting the Paxos Algorithm
Sort
View
STOC
2006
ACM
117views Algorithms» more  STOC 2006»
14 years 19 days ago
Pseudorandom walks on regular digraphs and the RL vs. L problem
We revisit the general RL vs. L question, obtaining the following results.
Omer Reingold, Luca Trevisan, Salil P. Vadhan
SRDS
2003
IEEE
13 years 12 months ago
Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers
This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers ...
Hagit Attiya, Amir Bar-Or
ICDCS
2002
IEEE
13 years 11 months ago
Fast Collect in the absence of contention
We present a generic module, called Fast Collect. Fast Collect is an implementation of Single-Writer Multi-Reader (SWMR) Shared-Memory in an asynchronous system in which a process...
Burkhard Englert, Eli Gafni
SIGIR
2012
ACM
11 years 9 months ago
Clarity re-visited
We present a novel interpretation of Clarity [5], a widely used query performance predictor. While Clarity is commonly described as a measure of the “distance” between the lan...
Shay Hummel, Anna Shtok, Fiana Raiber, Oren Kurlan...
FORTE
2010
13 years 8 months ago
On Efficient Models for Model Checking Message-Passing Distributed Protocols
Abstract. The complexity of distributed algorithms, such as state machine replication, motivates the use of formal methods to assist correctness verification. The design of the for...
Péter Bokor, Marco Serafini, Neeraj Suri