In this paper we investigate the problem of speculative processing in a replicated transactional system layered on top of an optimistic atomic broadcast service. We consider a realistic model in which transactions' read/write sets are not known a-priori, and transactions' data access patterns may vary depending on the observed snapshot. We formalize a set of correctness and optimality properties aimed at ensuring that transactions are not activated on inconsistent snapshots, as well as the minimality and completeness of the set of explored serialization orders. Finally, an optimal speculative transaction replication protocol is presented. © 2010 IEEE.
An optimal speculative transactional replication protocol / Romano, Paolo; Palmieri, Roberto; Quaglia, Francesco; Nuno, Carvalho; Luis, Rodrigues. - (2010), pp. 449-457. (Intervento presentato al convegno International Symposium on Parallel and Distributed Processing with Applications, ISPA 2010 tenutosi a Taipei; Taiwan, Province of China nel 6 September 2010 through 9 September 2010) [10.1109/ispa.2010.94].
An optimal speculative transactional replication protocol
ROMANO, Paolo;PALMIERI, ROBERTO;QUAGLIA, Francesco;
2010
Abstract
In this paper we investigate the problem of speculative processing in a replicated transactional system layered on top of an optimistic atomic broadcast service. We consider a realistic model in which transactions' read/write sets are not known a-priori, and transactions' data access patterns may vary depending on the observed snapshot. We formalize a set of correctness and optimality properties aimed at ensuring that transactions are not activated on inconsistent snapshots, as well as the minimality and completeness of the set of explored serialization orders. Finally, an optimal speculative transaction replication protocol is presented. © 2010 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
