Sciweavers

56 search results - page 3 / 12
» Atomic Broadcast in Asynchronous Crash-Recovery Distributed ...
Sort
View
SAC
2010
ACM
14 years 2 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
EUROPAR
1998
Springer
13 years 11 months ago
Exploiting Atomic Broadcast in Replicated Databases
Database replication protocols have historically been built on top of distributed database systems, and have consequently been designed and implemented using distributed transacti...
Fernando Pedone, Rachid Guerraoui, André Sc...
DC
1999
13 years 7 months ago
A Simple and Fast Asynchronous Consensus Protocol Based on a Weak Failure Detector
or fault-tolerant asynchronous systems. It abstracts a family of problems known as Agreement (or Coordination) problems. Any solution to consensus can serve as a basic building blo...
Michel Hurfin, Michel Raynal
WDAG
2000
Springer
111views Algorithms» more  WDAG 2000»
13 years 11 months ago
Thrifty Generic Broadcast
Weconsider the problemof generic broadcast in asynchronous systems with crashes, a problem that was rst studied in 12]. Roughly speaking, given a \con ict" relation on the set...
Marcos Kawazoe Aguilera, Carole Delporte-Gallet, H...
WORDS
2003
IEEE
14 years 19 days ago
An Optimal Atomic Broadcast Protocol and an Implementation Framework
Atomic Broadcast (where all processes deliver broadcast messages in the same order) is a very useful group communication primitive for building fault-tolerant distributed systems....
Paul D. Ezhilchelvan, Doug Palmer, Michel Raynal