Brief announcement: on speculative replication of transactional systems

Authors:
Paolo Romano;Roberto Palmieri;Francesco Quaglia;Nuno Carvalho;Luis Rodrigues
Affiliations:
INESC-ID, Lisbon, Portugal;Sapienza Rome University, Rome, Italy;Sapienza Rome University, Rome, Italy;INESC-ID/IST, Lisbon, Portugal;INESC-ID/IST, Lisbon, Portugal
Venue:
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Year:
2010

Citing 10
Cited 2

Concurrency control and recovery in database systems

Concurrency control and recovery in database systems
Group communication

Communications of the ACM
Permutation trees and variation statistics

European Journal of Combinatorics
The serializability of concurrent database updates

Journal of the ACM (JACM)
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
Processing Transactions over Optimistic Atomic Broadcast Protocols

ICDCS '99 Proceedings of the 19th IEEE International Conference on Distributed Computing Systems
On Statistically Estimated Optimistic Delivery in Wide-Area Total Order Protocols

PRDC '06 Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing
Towards distributed software transactional memory systems

LADIS '08 Proceedings of the 2nd Workshop on Large-Scale Distributed Systems and Middleware
D2STM: Dependable Distributed Software Transactional Memory

PRDC '09 Proceedings of the 2009 15th IEEE Pacific Rim International Symposium on Dependable Computing

WTTM 2011: the third workshop on the theory of transactional memory

ACM SIGACT News
On speculative replication of transactional systems

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define the problem of speculative processing in a replicated transactional system layered on top of an optimistic atomic broadcast service. A realistic model is considered in which transactions' read and write sets are not a priori known and transactions' data access patterns may vary depending on the observed snapshot. We formalize a set of correctness and optimality properties ensuring the minimality and completeness of the set of explored serialization orders within the replicated transactional system.