231 search results - page 19 / 47 » A Byzantine Fault Tolerant Distributed Commit Protocol |
154
click to vote
SRDS
1999
IEEE
15 years 8 months ago
1999
IEEE
Failures of all forms happen: from losing single network packets to site-wide disasters. Since businesses rely heavily on their data, it is imperative that failures require minima...
129
click to vote
ICDCS
2003
IEEE
15 years 9 months ago
2003
IEEE
In this paper, we focus on automated techniques to enhance the fault-tolerance of a nonmasking fault-tolerant program to masking. A masking program continually satisfies its spec...
140
click to vote
PODC
1997
ACM
15 years 8 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
144
click to vote
ICDCS
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper, we quantify the adverse effect of file sharing on the performance of reliable distributed applications. We demonstrate that file sharing incurs significant overhead...
155
click to vote
DCOSS
2006
Springer
15 years 7 months ago
2006
Springer
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...