Software partitioning of hardware transactions

Xiang, Lingxiang; Scott, Michael L.

doi:10.1145/2858788.2688506

Cited by 8 publications

(8 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Partitioned Transactions (ParT) [19] also uses the same trend of splitting the operations into a traversal (called planning) phase and a commit (called update) phase, but it gives more general guidelines than OTB. Specifically, ParT does not restrict the planning phase to be a traversal of a data structure and it allows this phase to be any generic block of code.…”

Section: Optimistic Semantic Synchronizationmentioning

confidence: 99%

Optimistic Transactional Boosting

Hassan

Palmieri

Peluso

et al. 2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

The last two decades witnessed the success of many efficient designs of concurrent data structures. A large set of them has a common base principle: each operation is split into a read-only traversal phase, which scans the data structure without locking or monitoring, and a read-write commit phase, which atomically validates the output of the traversal phase and applies the needed modifications to the data structure. In this paper we introduce Optimistic Transactional Boosting (OTB), an optimistic methodology for extending those designs in order to support the composition of multiple operations into one atomic execution by building a single traversal phase and a single commit phase for the whole atomic execution. As a result, OTB-based data structures are optimistic and composable. The former because they defer any locking and/or monitoring to the commit phase of the entire atomic execution; the latter because they allow the execution of multiple operations atomically. Additionally, in this paper we provide a theoretical model for analyzing OTB-based data structures and proving their correctness. In particular, we extended a recent approach that models concurrent data structures by including the two notions of optimism and composition of operations.

show abstract

Section: Optimistic Semantic Synchronizationmentioning

confidence: 99%

Optimistic Transactional Boosting

Hassan

Palmieri

Peluso

et al. 2017

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Recent work on reducing bookkeeping and conflict avoidance costs in STM includes techniques for exploiting hardware transactional memory [4,10,11,37,50]. These efforts focus on structuring transactions to reduce conflicts and minimize the transaction data footprint so they can run in hardware.…”

Section: Related Workmentioning

confidence: 99%

Type-aware transactions for faster concurrent code

Herman

Inala

Huang

et al. 2016

Proceedings of the Eleventh European Conference on Computer Systems

View full text Add to dashboard Cite

It is often possible to improve a concurrent system's performance by leveraging the semantics of its datatypes. We build a new software transactional memory (STM) around this observation. A conventional STM tracks read-and writesets of memory words; even simple operations can generate large sets. Our STM, which we call STO, tracks abstract operations on transactional datatypes instead. Parts of the transactional commit protocol are delegated to these datatypes' implementations, which can use datatype semantics, and new commit protocol features, to reduce bookkeeping, limit false conflicts, and implement efficient concurrency control. We test these ideas on the STAMP benchmark suite for STM applications and on our own prior work, the Silo high-performance in-memory database, observing large performance improvements in both systems.

show abstract

“…COP [17] and ParT [18] are generic methods for splitting large transactions in smaller fine-grained ones, and use RBT as a use case. They both employ an unsynchronized lookup phase followed by an HTM transaction that validates the lookup phase's outcome and updates the RBT.…”

Section: Related Workmentioning

confidence: 99%

Massively Concurrent Red-Black Trees with Hardware Transactional Memory

Siakavaras

Nikas

Goumas

et al. 2016

2016 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing (PDP)

View full text Add to dashboard Cite

Hardware Transactional Memory (HTM) is nowadays available in several commercial and HPC targeted processors and in the future it will likely be available on systems that can accommodate a very large number of threads. Thus, it is essential for the research community to target on evaluating HTM on as many cores as possible in order to understand the virtues and limitations that come with it.In this paper we utilize HTM to parallelize accesses on a classic data structure, a red-black tree. With minimal programming effort, we implement a red-black tree by enclosing each operation in a single HTM transaction and evaluate it on two servers equipped with Intel Haswell-EP and IBM Power8 processors, supporting a large number of hardware threads, namely 56 and 160 respectively. Our evaluation reveals that applying HTM in such a simplistic manner allows scalability for up to a limited number of hardware threads. To fully utilize the underlying hardware we apply different optimizations on each platform.

show abstract

Software partitioning of hardware transactions

Cited by 8 publications

References 22 publications

Optimistic Transactional Boosting

Optimistic Transactional Boosting

Type-aware transactions for faster concurrent code

Massively Concurrent Red-Black Trees with Hardware Transactional Memory

Contact Info

Product

Resources

About