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.
Brief announcement: On speculative replication of transactional systems / Paolo, Romano; Palmieri, Roberto; Quaglia, Francesco; Nuno, Carvalho; Luis, Rodrigues. - (2010), pp. 69-71. (Intervento presentato al convegno 22nd ACM Symposium on Parallelism in Algorithms and Architectures, SPAA'10 tenutosi a Thira; Greece nel 13 June 2010 through 15 June 2010) [10.1145/1810479.1810492].
Brief announcement: On speculative replication of transactional systems
PALMIERI, ROBERTO;QUAGLIA, Francesco;
2010
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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
