The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Epidemic algorithms in replicated databases (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Decentralized replicated-object protocols
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
On optimistic methods for concurrency control
ACM Transactions on Database Systems (TODS)
Optimistic voting for managing replicated data
Journal of Computer Science and Technology
Support for Speculative Update Propagation and Mobility in Deno
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
| Hi-index | 0.00 |
Epidemic model gives an efficient approach to transaction processing of replication systems in weakly connected environments. The approach has the advantages of high adaptation, support for low-bandwidth network, committing updates in an entirely decentralized control fashion, and so on. Optimistic voting protocol of epidemic model, which introduces condition and order vote in the voting process of transactions, takes an optimistic approach in conflict reconciliation. Though it brings down transaction abort rate dramatically when compared to other implementing protocols, optimistic voting protocol also rollbacks transactions unnecessarily. In this paper, transaction reordering technique is proposed in optimistic voting protocol to reduce the probability of transaction aborts. The protocol ensures one-copy serializability and does not lead to any deadlock situation. Experimental results suggest that the transaction reordering technique decreases abort rate and improves average response time of transactions markedly.