This paper introduces SPECULA, a novel replication protocol for Software Transactional Memory (STM) systems that seeks maximum overlap between transaction execution and replica synchronization phases via speculative processing techniques. By removing the replica synchronization phase from the critical path of execution of transactions, SPECULA allows threads to speculatively pipeline the execution of both transactional and/or non-transactional code. The core of SPECULA is a multi-version concurrency control algorithm that supports speculative transaction processing while ensuring the strong consistency criteria that are desirable in non-sand-boxed environments like STMs. Via an experimental study, based on a fully-fledged prototype and on both synthetic and standard STM benchmarks, we demonstrate that SPECULA can achieve speedups of up to one order of magnitude with respect to state-of-the-art non-speculative replication techniques. © 2012 IEEE.

SPECULA: Speculative replication of software transactional memory / Peluso, Sebastiano; Joao, Fernandes; ROMANO, Paolo; QUAGLIA, Francesco; Luis, Rodrigues. - (2012), pp. 91-100. (Intervento presentato al convegno 31st IEEE International Symposium on Reliable Distributed Systems, SRDS 2012 tenutosi a Irvine, CA; United States) [10.1109/SRDS.2012.67].

SPECULA: Speculative replication of software transactional memory

Peluso, Sebastiano;ROMANO, Paolo;QUAGLIA, Francesco;
2012

Abstract

This paper introduces SPECULA, a novel replication protocol for Software Transactional Memory (STM) systems that seeks maximum overlap between transaction execution and replica synchronization phases via speculative processing techniques. By removing the replica synchronization phase from the critical path of execution of transactions, SPECULA allows threads to speculatively pipeline the execution of both transactional and/or non-transactional code. The core of SPECULA is a multi-version concurrency control algorithm that supports speculative transaction processing while ensuring the strong consistency criteria that are desirable in non-sand-boxed environments like STMs. Via an experimental study, based on a fully-fledged prototype and on both synthetic and standard STM benchmarks, we demonstrate that SPECULA can achieve speedups of up to one order of magnitude with respect to state-of-the-art non-speculative replication techniques. © 2012 IEEE.
2012
31st IEEE International Symposium on Reliable Distributed Systems, SRDS 2012
replication protocols; software transactional memories; speculative processing; transactional systems
04 Pubblicazione in atti di convegno::04b Atto di convegno in volume
SPECULA: Speculative replication of software transactional memory / Peluso, Sebastiano; Joao, Fernandes; ROMANO, Paolo; QUAGLIA, Francesco; Luis, Rodrigues. - (2012), pp. 91-100. (Intervento presentato al convegno 31st IEEE International Symposium on Reliable Distributed Systems, SRDS 2012 tenutosi a Irvine, CA; United States) [10.1109/SRDS.2012.67].
File allegati a questo prodotto
File Dimensione Formato  
Peluso_SPECULA_2012.pdf

solo gestori archivio

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Tutti i diritti riservati (All rights reserved)
Dimensione 638.3 kB
Formato Adobe PDF
638.3 kB Adobe PDF   Contatta l'autore

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: https://hdl.handle.net/11573/477417
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 11
  • ???jsp.display-item.citation.isi??? 9
social impact