231 search results - page 5 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
ICFEM
2009
Springer
15 years 4 months ago
2009
Springer
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...
EUROPAR
2008
Springer
14 years 11 months ago
2008
Springer
We investigate a decentralised approach to committing transactions in a replicated database, under partial replication. Previous protocols either reexecute transactions entirely an...
ICDCS
2010
IEEE
15 years 1 months ago
2010
IEEE
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
104
Voted
TDSC
2011
14 years 4 months ago
2011
— Randomized agreement protocols have been around for more than two decades. Often assumed to be inefficient due to their high expected communication and computation complexitie...