Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
Lightweight causal and atomic group multicast
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Revisiting the Paxos Algorithm
WDAG '97 Proceedings of the 11th International Workshop on Distributed Algorithms
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Weighted voting for replicated data
SOSP '79 Proceedings of the seventh ACM symposium on Operating systems principles
Time vs. Space in Fault-Tolerant Distributed Systems
WORDS '01 Proceedings of the Sixth International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS'01)
Processing Transactions over Optimistic Atomic Broadcast Protocols
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Three-tier replication for FT-CORBA infrastructures
Software—Practice & Experience
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
From spontaneous total order to uniform total order: different degrees of optimistic delivery
Proceedings of the 2006 ACM symposium on Applied computing
Improving impact of self-adaptation and self-management research through evaluation methodology
Proceedings of the 2010 ICSE Workshop on Software Engineering for Adaptive and Self-Managing Systems
Replicating multithreaded web services
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Optimistic Scheduling with Geographically Replicated Services in the Cloud Environment (COLOR)
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Scalable service-oriented replication with flexible consistency guarantee in the cloud
Information Sciences: an International Journal
Hi-index | 0.00 |
Abstract: Replication is a powerful technique for increasing availability of a distributed service. Algorithms for replicating distributed services do however face a dilemma: they should be (1) efficient (low latency), while (2) ensuring consistency of the replicas, which are two contradictory goals. The paper concentrates on active replication, where all the replicas handle the clients' requests. Active replication is usually implemented using the Atomic Broadcast primitive. To be efficient, some Atomic Broadcast algorithms deliberately sacrifice consistency, if inconsistency is likely to occur with a low probability. We present in the paper an algorithm that handles replication efficiently in most scenarios, while preventing inconsistencies. The originality of the algorithm is to take the client-server interaction into account, while traditional solutions consider Atomic Broadcast as a black box.