Open Access
- 16 December 2016
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Architecture and Code Optimization
- Vol. 13 (4) , 1-24
Abstract
This article presents Pot, a system that leverages the concept of preordered transactions to achieve deterministic multithreaded execution of programs that use Transactional Memory. Preordered transactions eliminate the root cause of nondeterminism in transactional execution: they provide the illusion of executing in a deterministic serial order, unlike traditional transactions that appear to execute in a nondeterministic order that can change from execution to execution. Pot uses a new concurrency control protocol that exploits the serialization order to distinguish between fast and speculative transaction execution modes in order to mitigate the overhead of imposing a deterministic order. We build two Pot prototypes: one using STM and another using off-the-shelf HTM. To the best of our knowledge, Pot enables deterministic execution of programs using off-the-shelf HTM for the first time. An experimental evaluation shows that Pot achieves deterministic execution of TM programs with low overhead, sometimes even outperforming nondeterministic executions, and clearly outperforming the state of the art.Keywords
All Related Versions
Funding Information
- Fundação para a Ciência e Tecnologia, Ministério da Ciência, Tecnologia, e Ensino Superior (SFRH/BD/84497/2012 and PEst/UID/CEC/04516/2013)
This publication has 27 references indexed in Scilit:
- Effective Transactional Memory Execution Management for Improved ConcurrencyACM Transactions on Architecture and Code Optimization, 2014
- Dthreads2011
- Fastpath Speculative Parallelization2010
- Grace2009
- Learning from mistakes2008
- STMBench72007
- Transactional Locking II2006
- Software transactional memoryDistributed Computing, 1997
- Implementing fault-tolerant services using the state machine approach: a tutorialACM Computing Surveys, 1990
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981