Concurrency control protocols based on read-validation schemes allow transactions which are doomed to abort to still run until a subsequent validation check reveals them as invalid. These late aborts do not favor the reduction of wasted computation and can penalize performance. To counteract this problem, we present an analytical model that predicts the abort probability of transactions handled via read-validation schemes. Our goal is to determine what are the suited points-along a transaction lifetime-to carry out a validation check. This may lead to early aborting doomed transactions, thus saving CPU time. We show how to exploit the abort probability predictions returned by the model in combination with a threshold-based scheme to trigger read-validations. We also show how this approach can definitely improve performance-leading up to 14 % better turnaround-as demonstrated by some experiments carried out with a port of the TPC-C benchmark to Software Transactional Memory.

Model-Based Proactive Read-Validation in Transaction Processing Systems / Economo, Simone; Silvestri, Emiliano; Di Sanzo, Pierangelo; Pellegrini, Alessandro; Quaglia, Francesco. - (2018), pp. 481-488. ((Intervento presentato al convegno 24th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2018 tenutosi a Singapore; Singapore [10.1109/PADSW.2018.8644605].

Model-Based Proactive Read-Validation in Transaction Processing Systems

Economo, Simone
;
Silvestri, Emiliano;Di Sanzo, Pierangelo;Pellegrini, Alessandro
;
Quaglia, Francesco
2018

Abstract

Concurrency control protocols based on read-validation schemes allow transactions which are doomed to abort to still run until a subsequent validation check reveals them as invalid. These late aborts do not favor the reduction of wasted computation and can penalize performance. To counteract this problem, we present an analytical model that predicts the abort probability of transactions handled via read-validation schemes. Our goal is to determine what are the suited points-along a transaction lifetime-to carry out a validation check. This may lead to early aborting doomed transactions, thus saving CPU time. We show how to exploit the abort probability predictions returned by the model in combination with a threshold-based scheme to trigger read-validations. We also show how this approach can definitely improve performance-leading up to 14 % better turnaround-as demonstrated by some experiments carried out with a port of the TPC-C benchmark to Software Transactional Memory.
9781538673089
File allegati a questo prodotto
File Dimensione Formato  
Economo_Posprint_Model-Based_2018.pdf

accesso aperto

Note: https://ieeexplore.ieee.org/document/8644605
Tipologia: Documento in Post-print (versione successiva alla peer review e accettata per la pubblicazione)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 213.14 kB
Formato Adobe PDF
213.14 kB Adobe PDF Visualizza/Apri PDF
Economo_Model-Based_2018.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 999.69 kB
Formato Adobe PDF
999.69 kB Adobe PDF   Visualizza/Apri   Richiedi una copia
Economo_Frontespizio-indice_Model-Based_2018.pdf

solo gestori archivio

Tipologia: Altro materiale allegato
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 390.8 kB
Formato Adobe PDF
390.8 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11573/1261794
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact