On Developing Optimistic Transactional Lazy Set

Hassan, Ahmed; Palmieri, Roberto; Ravindran, Binoy

doi:10.1007/978-3-319-14472-6_29

Cited by 14 publications

(13 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Bronson et al proposed transaction prediction, which maps the abstract state of a set into memory blocks called predicate and relies on STM to synchronize transactional accesses [2]. Hassan et al [20] proposed an optimistic version of boosting, which employs a white box design and provides throughput and usability benefits over the original boosting approach. Other STM variants, such open nested transactions [32] support a more relaxed transaction model that leverages some semantic knowledge based on programmers' input.…”

Section: Semantic Conflict Detectionmentioning

confidence: 99%

Lock-free Transactions without Rollbacks for Linked Data Structures

Zhang

Dechev

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

Non-blocking data structures allow scalable and thread-safe accesses to shared data. They provide individual operations that appear to execute atomically. However, it is often desirable to execute multiple operations atomically in a transactional manner. Previous solutions, such as software transactional memory (STM) and transactional boosting, manage transaction synchronization in an external layer separated from the data structure's own thread-level concurrency control. Although this reduces programming effort, it leads to overhead associated with additional synchronization and the need to rollback aborted transactions. In this work, we present a new methodology for transforming high-performance lock-free linked data structures into high-performance lock-free transactional linked data structures without revamping the data structures' original synchronization design. Our approach leverages the semantic knowledge of the data structure to eliminate the overhead of false conflicts and rollbacks. We encapsulate all operations, operands, and transaction status in a transaction descriptor, which is shared among the nodes accessed by the same transaction. We coordinate threads to help finish the remaining operations of delayed transactions based on their transaction descriptors. When transaction fails, we recover the correct abstract state by reversely interpreting the logical status of a node. In our experimental evaluation using transactions with randomly generated operations, our lock-free transactional lists and skiplist outperform the transactional boosted ones by 40% on average and as much as 125% for large transactions. They also outperform the alternative STM-based approaches by a factor of 3 to 10 across all scenarios. More importantly, we achieve 4 to 6 orders of magnitude less spurious aborts than the alternatives.

show abstract

Section: Semantic Conflict Detectionmentioning

confidence: 99%

Lock-free Transactions without Rollbacks for Linked Data Structures

Zhang

Dechev

2016

Proceedings of the 28th ACM Symposium on Parallelism in Algorithms and Architectures

View full text Add to dashboard Cite

show abstract

“…STO's flexibility lets datatype designers adopt many ideas from the literature on concurrent datatype design, including locking, optimistic verification, direct updates (eager versioning), and deferred updates (lazy versioning) [22,27]. Our datatypes take advantage of this flexibility; for instance, our map data structures use direct updates for inserted items and deferred updates for all other modifications ( §4), and our list datatypes use some techniques like those in the optimistic transactional lazy set [24]. Lock-free compare-andswap designs tend to interact badly with transactions, however, since transactional commit protocols use locking to ensure that multiple modifications appear to commit atomically.…”

Section: Related Workmentioning

confidence: 99%

“…Other STM systems have partially integrated concurrent datatypes, some using new layers of concurrency control, such as pessimistic lock tables and undo logs [25] or predicate tables of STM words [2], and others co-developing a commit protocol and a datatype implementation [23,24]. STO has lower overhead than many of these systems, but it also can support their ideas separately or in combination.…”

Section: Introductionmentioning

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

“…Recently, a third trend, which we name Optimistic Semantic Synchronization (OSS), has emerged to overcome the limitations of the above approaches. Examples of this new approach include methodologies like [1,4,25,16,15,6]. We used the word optimistic because all of these solutions share a fundamental optimism.…”

Section: Introductionmentioning

confidence: 99%

“…Optimistic Transactional Boosting (OTB) methodology [15,16] is the optimistic version of TB. It lists three guidelines to convert any optimistic concurrent data structure into a transactional one.…”

Section: Introductionmentioning

confidence: 99%

Transactional Interference-Less Balanced Tree

Hassan

Palmieri

Ravindran

2015

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

In this paper, we present TxCF-Tree, a balanced tree whose design is optimized to support transactional accesses. The core optimizations of TxCF-Tree's operations are: providing a traversal phase that does not use any lock and/or speculation, and deferring the lock acquisition or physical modification to the transaction's commit phase; isolating the structural operations (such as re-balancing) in an interference-less housekeeping thread; and minimizing the interference between structural operations and the critical path of semantic operations (i.e., additions and removals on the tree). We evaluated TxCF-Tree against the stateof-the-art general methodologies for designing transactional trees and we show that TxCF-Tree's design pays off in most of workloads.

show abstract

On Developing Optimistic Transactional Lazy Set

Cited by 14 publications

References 17 publications

Lock-free Transactions without Rollbacks for Linked Data Structures

Lock-free Transactions without Rollbacks for Linked Data Structures

Type-aware transactions for faster concurrent code

Transactional Interference-Less Balanced Tree

Contact Info

Product

Resources

About