Sciweavers

231 search results - page 21 / 47
» A Byzantine Fault Tolerant Distributed Commit Protocol
Sort
View
OPODIS
2008
15 years 5 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...
PODC
2009
ACM
16 years 4 months ago
Simple and efficient asynchronous byzantine agreement with optimal resilience
Consider a completely asynchronous network consisting of n parties where every two parties are connected by a private channel. An adversary At with unbounded computing power activ...
Arpita Patra, Ashish Choudhary, C. Pandu Rangan
IPPS
2006
IEEE
15 years 10 months ago
An advanced performance analysis of self-stabilizing protocols: stabilization time with transient faults during convergence
A self-stabilizing protocol is a brilliant framework for fault tolerance. It can recover from any number and any type of transient faults and eventually converge to its intended b...
Yoshihiro Nakaminami, Hirotsugu Kakugawa, Toshimit...
IPPS
2005
IEEE
15 years 9 months ago
Impact of Event Logger on Causal Message Logging Protocols for Fault Tolerant MPI
— Fault tolerance in MPI becomes a main issue in the HPC community. Several approaches are envisioned from user or programmer controlled fault tolerance to fully automatic fault ...
Aurelien Bouteiller, Boris Collin, Thomas Hé...
CCGRID
2008
IEEE
15 years 6 months ago
Fault Tolerance in Cluster Federations with O2P-CF
Fault tolerance is one of the key issues for large scale applications executed on high performance computing systems. In a cluster federation, clusters are gathered to provide hug...
Thomas Ropars, Christine Morin