Sciweavers

1124 search results - page 13 / 225
» Refined quorum systems
Sort
View
OSDI
2006
ACM
16 years 2 months ago
HQ Replication: A Hybrid Quorum Protocol for Byzantine Fault Tolerance
There are currently two approaches to providing Byzantine-fault-tolerant state machine replication: a replica-based approach, e.g., BFT, that uses communication between replicas t...
James A. Cowling, Daniel S. Myers, Barbara Liskov,...
108
Voted
ICDCS
2005
IEEE
15 years 7 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
SRDS
1999
IEEE
15 years 6 months ago
Information Dissemination in Partitionable Mobile Ad Hoc Networks
Ad-hoc wireless networks have no wired component, and may have unpredictable mobility pattern. Such networks can get partitioned and reconnected several times. One possible approa...
Goutham Karumanchi, Srinivasan Muralidharan, Ravi ...
DSN
2004
IEEE
15 years 5 months ago
A Framework for Dynamic Byzantine Storage
We present a framework for transforming several quorum-based protocols so that they can dynamically adapt their failure threshold and server count, allowing them to be reconfigure...
Jean-Philippe Martin, Lorenzo Alvisi
145
Voted
DALT
2009
Springer
15 years 5 months ago
The Refinement of Choreographed Multi-Agent Systems
This paper generalises the theory of agent refinement from [1] to multi-agent systems in the presence of new coordination mechanisms extended with real time. The generalisation is ...
Lacramioara Astefanoaei, Frank S. de Boer, Mehdi D...