Sciweavers

231 search results - page 16 / 47
» A Byzantine Fault Tolerant Distributed Commit Protocol
Sort
View
ICDCS
2011
IEEE
14 years 3 months ago
Smart Redundancy for Distributed Computation
Many distributed software systems allow participation by large numbers of untrusted, potentially faulty components on an open network. As faults are inevitable in this setting, th...
Yuriy Brun, George Edwards, Jae Young Bang, Nenad ...
IPPS
2007
IEEE
15 years 10 months ago
A Fault Tolerance Protocol with Fast Fault Recovery
Fault tolerance is an important issue for large machines with tens or hundreds of thousands of processors. Checkpoint-based methods, currently used on most machines, rollback all ...
Sayantan Chakravorty, Laxmikant V. Kalé
148
Voted
CSUR
2004
132views more  CSUR 2004»
15 years 3 months ago
Approaches to fault-tolerant and transactional mobile agent execution---an algorithmic view
Over the past years, mobile agent technology has attracted considerable attention, and a significant body of literature has been published. To further develop mobile agent technol...
Stefan Pleisch, André Schiper
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
16 years 4 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan