Sciweavers

83 search results - page 10 / 17
» Consensus in byzantine asynchronous systems
Sort
View
FTCS
1998
89views more  FTCS 1998»
13 years 8 months ago
The Timed Asynchronous Distributed System Model
Abstract-- We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and...
Flaviu Cristian, Christof Fetzer
ICTAC
2005
Springer
14 years 1 months ago
Revisiting Failure Detection and Consensus in Omission Failure Environments
It has recently been shown that fair exchange, a security problem in distributed systems, can be reduced to a fault tolerance problem, namely a special form of distributed consensu...
Carole Delporte-Gallet, Hugues Fauconnier, Felix C...
DSN
2004
IEEE
13 years 11 months ago
Efficient Byzantine-Tolerant Erasure-Coded Storage
This paper describes a decentralized consistency protocol for survivable storage that exploits local data versioning within each storage-node. Such versioning enables the protocol...
Garth R. Goodson, Jay J. Wylie, Gregory R. Ganger,...
PODC
2009
ACM
14 years 8 months ago
Dynamic atomic storage without consensus
This paper deals with the emulation of atomic read/write (R/W) storage in dynamic asynchronous message passing systems. In static settings, it is well known that atomic R/W storag...
Marcos Kawazoe Aguilera, Idit Keidar, Dahlia Malkh...
ICFEM
2009
Springer
14 years 2 months ago
Role-Based Symmetry Reduction of Fault-Tolerant Distributed Protocols with Language Support
Fault-tolerant (FT) distributed protocols (such as group membership, consensus, etc.) represent fundamental building blocks for many practical systems, e.g., the Google File System...
Péter Bokor, Marco Serafini, Neeraj Suri, H...