Sciweavers

89 search results - page 12 / 18
» The overhead of consensus failure recovery
Sort
View
ICDE
1991
IEEE
105views Database» more  ICDE 1991»
13 years 11 months ago
Voting with Regenerable Volatile Witnesses
Voting protocols ensure the consistency of replicated objects by requiring all read and write requests to collect an appropriate quorum of replicas. We propose to replace some of ...
Jehan-François Pâris, Darrell D. E. L...
TPDS
1998
135views more  TPDS 1998»
13 years 7 months ago
On Coordinated Checkpointing in Distributed Systems
—Coordinated checkpointing simplifies failure recovery and eliminates domino effects in case of failures by preserving a consistent global checkpoint on stable storage. However, ...
Guohong Cao, Mukesh Singhal
SC
2009
ACM
14 years 2 months ago
Supporting fault-tolerance for time-critical events in distributed environments
In this paper, we consider the problem of supporting fault tolerance for adaptive and time-critical applications in heterogeneous and unreliable grid computing environments. Our g...
Qian Zhu, Gagan Agrawal
MOBICOM
1996
ACM
13 years 11 months ago
Building Reliable Mobile-Aware Applications Using the Rover Toolkit
This paper discusses extensions to the Rover toolkit for constructing reliable mobile-aware applications. The extensions improve upon the existing failure model, which only addres...
Anthony D. Joseph, M. Frans Kaashoek
TRIDENTCOM
2006
IEEE
14 years 1 months ago
A reliable optimization on distributed mutual exclusion algorithm
– This paper presents a reliable decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. When any failure...
Moharram Challenger, Peyman Bayat, Mohammad Reza M...