DeTrans: Deterministic and Parallel execution of Transactions

Smiljković, Vesna; Stipić, Srđan; Fetzer, Christof; Unsal, Osman S.; Cristal, Adrián; Valero, Mateo

doi:10.1109/sbac-pad.2014.20

Cited by 4 publications

(8 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We took the modified version that supports transactions and was used in [8]. Additionally, we modified the test to invoke libc.…”

Section: Methodsmentioning

confidence: 99%

“…multi-threaded programs that use pthread 4 calls as synchronization points), DeTrans (Smiljkovic et al [8]) and DeSTM (Ravichandran et al [9]) propose deterministic execution of TM-based programs.…”

Section: Related Workmentioning

confidence: 99%

“…Dthreads allows invoking some system calls, and each thread maintains its private copy of a shared libc structure. However, these systems cannot be used for TM-based applications due to differences in synchronization mechanisms [8].…”

Section: Related Workmentioning

confidence: 99%

“…To make every execution of a TM-based application repeatable, Smiljkovic et al [8] and Ravichandran et al [9] proposed systems for deterministic execution -DeTrans and DeSTM, respectively. They guarantee that threads always interleave in the same order and the application always gives the same output for the same input parameters.…”

Section: Introductionmentioning

confidence: 99%

“…It is based on a runtime (DeTrans [8]) that provides deterministic execution even in the presence of data races, and a TM-based libc (TMdietlibc [10]) that allows transactions to concurrently execute libc functions, and serializes them only if the libc function invokes a system call. DeTrans-lib ensures that transactions invoke system calls in deterministic order, which prevents from having deadlocks caused by serialization and deterministic execution.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Determinism at Standard-Library Level in TM-Based Applications

Smiljković

Ünsal

Cristal

et al. 2015

Int J Parallel Prog

Self Cite

View full text Add to dashboard Cite

Abstract. Deterministic execution of a multi-threaded application guarantees that threads access shared memory in the same order and the application gives the same output when it runs with the same input parameters. Determinism provides repeatability, which helps a programmer in testing and debugging. Additionally, Transactional Memory (TM) simplifies development of applications that use transactions (instead of locks) to synchronize accesses to shared memory. However, transactions that call standard library functions have to be serialized, and the serialization causes a deadlock when applications run with the deterministic systems proposed so far. In this paper, we present DeTrans-lib, the first standard C library that provides deterministic execution of TM-based applications at user and standard-library level. DeTrans-lib avoids deadlocks by performing transaction serialization in deterministic order. We evaluate DeTrans-lib using benchmarks that perform I/O operations.

show abstract

“…We took the modified version that supports transactions and was used in [8]. Additionally, we modified the test to invoke libc.…”

Section: Methodsmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Determinism at Standard-Library Level in TM-Based Applications

Smiljković

Ünsal

Cristal

et al. 2015

Int J Parallel Prog

Self Cite

View full text Add to dashboard Cite

show abstract

Concurrent software testing in practice: a catalog of tools

Melo

Souza

Silva

et al. 2015

Proceedings of the 6th International Workshop on Automating Test Case Design, Selection and Evaluation

View full text Add to dashboard Cite

Pot

Vale

Silva

Dias³

et al. 2016

ACM Trans. Archit. Code Optim.

View full text Add to dashboard Cite

This paper 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 which 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. ACM Reference Format:

show abstract

DeTrans: Deterministic and Parallel execution of Transactions

Cited by 4 publications

References 25 publications

Determinism at Standard-Library Level in TM-Based Applications

Determinism at Standard-Library Level in TM-Based Applications

Concurrent software testing in practice: a catalog of tools

Pot

Contact Info

Product

Resources

About