Sciweavers

46 search results - page 5 / 10
» Dynamic Byzantine Quorum Systems
Sort
View
CP
2010
Springer
14 years 10 months ago
Load Balancing and Almost Symmetries for RAMBO Quorum Hosting
Abstract. Rambo is the Reconfigurable Atomic Memory for Basic Objects, a formally specified algorithm that implements atomic read/write shared memory in dynamic networks, where t...
Laurent Michel, Alexander A. Shvartsman, Elaine L....
SOSP
2005
ACM
15 years 8 months ago
Fault-scalable Byzantine fault-tolerant services
A fault-scalable service can be configured to tolerate increasing numbers of faults without significant decreases in performance. The Query/Update (Q/U) protocol is a new tool t...
Michael Abd-El-Malek, Gregory R. Ganger, Garth R. ...
EUROSYS
2007
ACM
15 years 8 months ago
Antiquity: exploiting a secure log for wide-area distributed storage
Antiquity is a wide-area distributed storage system designed to provide a simple storage service for applications like file systems and back-up. The design assumes that all serve...
Hakim Weatherspoon, Patrick R. Eaton, Byung-Gon Ch...
IPCCC
2006
IEEE
15 years 5 months ago
Maille authorization - a distributed, redundant authorization protocol
The Maille Authorization protocol provides flexible and reliable authorization in large distributed and pervasive computing systems. Service owners distribute their access control...
Andrew Fritz, Jehan-François Pâris
ICDCS
2005
IEEE
15 years 5 months ago
A Dynamic Group Mutual Exclusion Algorithm Using Surrogate-Quorums
The group mutual exclusion problem extends the traditional mutual exclusion problem by associating a type with each critical section. In this problem, processes requesting critica...
Ranganath Atreya, Neeraj Mittal