Sciweavers

5 search results - page 1 / 1
» Disk Paxos
Sort
View
PODC
2004
ACM
13 years 10 months ago
Byzantine disk paxos: optimal resilience with byzantine shared memory
We present Byzantine Disk Paxos, an asynchronous shared-memory consensus algorithm that uses a collection of n > 3t disks, t of which may fail by becoming non-responsive or arb...
Ittai Abraham, Gregory Chockler, Idit Keidar, Dahl...
WDAG
2000
Springer
90views Algorithms» more  WDAG 2000»
13 years 9 months ago
Disk Paxos
Eli Gafni, Leslie Lamport
HPDC
2008
IEEE
13 years 11 months ago
FaTLease: scalable fault-tolerant lease negotiation with paxos
A lease is a token which grants its owner exclusive access to a resource for a defined span of time. In order to be able to tolerate failures, leases need to be coordinated by di...
Felix Hupfeld, Björn Kolbeck, Jan Stender, Mi...
ICDCS
2002
IEEE
13 years 10 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
ATVA
2006
Springer
109views Hardware» more  ATVA 2006»
13 years 7 months ago
Proactive Leader Election in Asynchronous Shared Memory Systems
Abstract. In this paper, we give an algorithm for fault-tolerant proactive leader election in asynchronous shared memory systems, and later its formal verification. Roughly speakin...
M. C. Dharmadeep, K. Gopinath