Concurrency control and recovery in database systems
Concurrency control and recovery in database systems
The dangers of replication and a solution
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The serializability of concurrent database updates
Journal of the ACM (JACM)
The Database State Machine Approach
Distributed and Parallel Databases
Value-cognizant Speculative Concurrency Control
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract)
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Optimistic atomic broadcast: a pragmatic viewpoint
Theoretical Computer Science - Special issue: Distributed computing
A Suite of Database Replication Protocols based on Group Communication Primitives
ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Software transactional memory for dynamic-sized data structures
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Appia: A Flexible Protocol Kernel Supporting Multiple Coordinated Channels
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Processing Transactions over Optimistic Atomic Broadcast Protocols
ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
Speculative Locking Protocols to Improve Performance for Distributed Database Systems
IEEE Transactions on Knowledge and Data Engineering
MIDDLE-R: Consistent database replication at the middleware level
ACM Transactions on Computer Systems (TOCS)
Introduction to Reliable Distributed Programming
Introduction to Reliable Distributed Programming
A flexible framework for implementing software transactional memory
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols
PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
On the correctness of transactional memory
Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Permissiveness in Transactional Memories
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Towards distributed software transactional memory systems
LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
Brief announcement: virtual world consistency: a new condition for STM systems
Proceedings of the 28th ACM symposium on Principles of distributed computing
Multithreading-Enabled Active Replication for Event Stream Processing Operators
SRDS '09 Proceedings of the 2009 28th IEEE International Symposium on Reliable Distributed Systems
Brief announcement: on speculative replication of transactional systems
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
An Optimal Speculative Transactional Replication Protocol
ISPA '10 Proceedings of the International Symposium on Parallel and Distributed Processing with Applications
| Hi-index | 0.00 |
In this paper we investigate, from a theoretical perspective, the problem of how to build speculative replication protocols for transactional systems layered on top of an Optimistic Atomic Broadcast (OAB) service. The OAB service provides an early, possibly erroneous, guess on transaction@?s final serialization order. This can be exploited to speculatively execute transactions in parallel with the algorithm used to determine their final total delivery (and serialization) order. To maximize the chances of guessing their final serialization order, transactions are executed multiple times, speculating on the possible orderings eventually determined by the OAB service. We formalize the Speculative Transactional Replication (STR) problem by means of a set of properties ensuring that transactions are never activated on inconsistent snapshots, as well as the minimality and completeness of the set of speculatively explored serialization orders. Finally, we present a protocol solving the STR problem, along with simulation results assessing its effectiveness.