EUROSYS
2011
ACM
12 years 8 months ago
2011
ACM
Traditional agreement-based Byzantine fault-tolerant (BFT) systems process all requests on all replicas to ensure consistency. In addition to the overhead for BFT protocol and sta...
DSE
1998
13 years 4 months ago
1998
The Voltan software library for building distributed applications provides the support for (i) a processpair to act as single Voltan self-checking ‘fail-silent’ process; and (...
OPODIS
2007
13 years 6 months ago
2007
We present a novel translation of systems that are tolerant of crash failures to systems that are tolerant of Byzantine failures in an asynchronous environment, making weaker assum...
OPODIS
2007
13 years 6 months ago
2007
This paper tackles the consensus problem in asynchronous systems prone to byzantine failures. One way to circumvent the FLP impossibility result consists in adding synchrony assump...
FSTTCS
1997
Springer
13 years 8 months ago
1997
Springer
We illustrate in this paper a compositional and stepwise method for designing programs that o er a potentially unique tolerance to each of their fault-classes. More speci cally, o...
SRDS
2003
IEEE
13 years 9 months ago
2003
IEEE
This paper presents fault-tolerant simulations of a single-writer multi-reader regular register in storage systems. One simulation tolerates fail-stop failures of storage servers ...
DSN
2006
IEEE
13 years 10 months ago
2006
IEEE
We study consensus in a message-passing system where only some of the Ò¾ links exhibit some synchrony. This problem was previously studied for systems with process crashes; we n...