Design and implementation of transactional constructs for C/C++

NiYang,; WelcAdam,; Adl-TabatabaiAli-Reza,; BachMoshe,; BerkowitsSion,; CownieJames,; GevaRobert,; KozhukowSergey,; NarayanaswamyRavi,; OlivierJeffrey,; PreisSerguei,; SahaBratin,; TalAdy,; TianXinmin,

doi:10.1145/1449955.1449780

Cited by 27 publications

(44 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Note that our experiments with other state-of-the-art STMs [5,14,18,20] confirm our results [6]. SwissTM and the used benchmarks are available at http://lpd.epfl.ch/site/research/tmeval.…”

Section: Evaluation Settingssupporting

confidence: 84%

See 1 more Smart Citation

Why STM can be more than a research toy

et al. 2011

View full text Add to dashboard Cite

Software Transactional Memory (STM) promises to simplify concurrent programming without requiring specific hardware support. Yet, STM's credibility lies on the extent to which it enables to leverage multicores and outperform sequential code. A recent CACM paper [3] questioned this ability and suggested the confinement of STM to a research toy.We revisit these conclusions through the most to date extensive comparison of STM performance to sequential code. We evaluate a state-of-the-art STM system, SwissTM, on a wide range of benchmarks and two different multicore systems. We dissect the inherent costs of synchronization as well as the overheads of compiler instrumentation and transparent privatization.Our results show that an STM with manually instrumented benchmarks and explicit privatization outperforms sequential code by up to 29 times on SPARC with 64 concurrent threads and by up to 9 times on x86 with 16 concurrent threads. Indeed the overheads of compiler instrumentation and transparent privatization are substantial, yet they do not prevent STM from generally outperforming sequential code.

show abstract

“…Note that our experiments with other state-of-the-art STMs [5,14,18,20] confirm our results [6]. SwissTM and the used benchmarks are available at http://lpd.epfl.ch/site/research/tmeval.…”

Section: Evaluation Settingssupporting

confidence: 84%

“…In [18], optimizations that replace full STM load and store calls with specialized, faster versions of the same calls are described. For example, some STMs can perform fast reads of memory locations that were previously accessed for writing inside the same transaction.…”

Section: Stm-ce Performancementioning

confidence: 99%

Why STM can be more than a research toy

et al. 2011

View full text Add to dashboard Cite

show abstract

“…More recently, several STMs have been presented that use algorithms very similar to LSA [14], [15]. Riegel et al [16] show how to extend LSA so that imprecisely synchronized clocks can be used as a scalable implementation of the global commit time base.…”

Section: Related Workmentioning

confidence: 99%

Time-Based Software Transactional Memory

Felber

Fetzer

Marlier

et al. 2010

IEEE Trans. Parallel Distrib. Syst.

118

View full text Add to dashboard Cite

Abstract-Software transactional memory (STM) is a concurrency control mechanism that is widely considered to be easier to use by programmers than other mechanisms such as locking. The first generations of STMs have either relied on visible read designs, which simplify conflict detection while pessimistically ensuring a consistent view of shared data to the application, or optimistic invisible read designs that are significantly more efficient but require incremental validation to preserve consistency, at a cost that increases quadratically with the number of objects read in a transaction. Most of the recent designs now use a "time-based" (or "time stampbased") approach to still benefit from the performance advantage of invisible reads without incurring the quadratic overhead of incremental validation. In this paper, we give an overview of the time-based STM approach and discuss its benefits and limitations. We formally introduce the first time-based STM algorithm, the Lazy Snapshot Algorithm (LSA). We study its semantics and the impact of its design parameters, notably multiversioning and dynamic snapshot extension. We compare it against other classical designs and we demonstrate that its performance is highly competitive, both for obstruction-free and lock-based STM designs.

show abstract

“…There exist implementations of software transactional memory for many programming languages (e.g., Brevnov et al, 2008;Ni et al, 2008). Some of the problems faced by implementers is that the encapsulation of transactions is not easily enforced, and exceptions, I/O operations and global, mutable state can break the transaction abstraction.…”

Section: Software Transactional Memory In Haskellmentioning

confidence: 99%

Can Software Transactional Memory Make Concurrent Programs Simple and Safe?

Malde

2013

Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms

View full text Add to dashboard Cite

Abstract:Parallel programs are key to exploiting the performance of modern computers, but traditional facilities for synchronizing threads of execution are notoriously difficult to use correctly, especially for problems with a non-trivial structure. Software transactional memory is a different approach to managing the complexity of interacting threads. By eliminating locking, many of the complexities of concurrency is eliminated, and the resulting programs are composable, and thus simplifies refactoring and other modifications. Here, we investigate STM in the context of genome assembly, and demonstrate that a program using STM is able to successfully parallelize the genome scaffolding process with a near linear speedup.

show abstract

Design and implementation of transactional constructs for C/C++

Cited by 27 publications

References 46 publications

Why STM can be more than a research toy

Why STM can be more than a research toy

Time-Based Software Transactional Memory

Can Software Transactional Memory Make Concurrent Programs Simple and Safe?

Contact Info

Product

Resources

About