Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Implementing database replication protocols based on O2PL in a middleware architecture
DBA'06 Proceedings of the 24th IASTED international conference on Database and applications
Optimistic transactional active replication
Proceedings of the 2nd international conference on Ubiquitous information management and communication
Formal Development of a Total Order Broadcast for Distributed Transactions Using Event-B
Methods, Models and Tools for Fault Tolerance
Symmetric active/active metadata service for high availability parallel file systems
Journal of Parallel and Distributed Computing
A formal analysis of database replication protocols with SI replicas and crash failures
The Journal of Supercomputing
A protocol for reconciling recovery and high-availability in replicated databases
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Database replication: a tutorial
Replication
Proof and evaluation of a 1CS middleware data replication protocol based on O2PL
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Unifying thread-level speculation and transactional memory
Proceedings of the 13th International Middleware Conference
SMASH: speculative state machine replication in transactional systems
Proceedings Demo & Poster Track of ACM/IFIP/USENIX International Middleware Conference
Hi-index | 0.00 |
Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. Recently, a new approach has been proposed for atomic broadcast which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery to the application. In this paper, we develop this idea further and show how applications can take even more advantage of the optimistic assumption by overlapping the coordination phase of the atomic broadcast algorithm with the processing of delivered messages. In particular, we present a replicated database architecture that employs the new atomic broadcast primitive in such a way that communication and transaction processing are fully overlapped, providing high performance without relaxing transaction correctness.