This monograph grows out of nearly 40 years of experience in synchronization and
concurrent data structures. Though written primarily from the perspective of systems …

Transactional data structures support threads executing a sequence of operations
atomically. Dynamic transactions allow operands to be generated on the fly and allows …

Blockchain-based platforms, such as Ethereum, allow transactions in blocks to call user-
defined scripts named smart contracts. In the blockchain network, after being generated by a …

Transactional data structures allow data structures to support transactional execution, in
which a sequence of operations appears to execute atomically. We consider a paradigm in …

Smart contract transactions demonstrate issues of performance and correctness that
application programmers must work around. Although the blockchain consensus …

DRP is a new concurrency control protocol for software transactional memory that achieves
high throughput, even for skewed workloads that exhibit high contention. DRP builds on …

Transactional memory simplifies multiprocessor programming by providing the guarantee
that a sequential block of code in the form of a transaction will exhibit atomicity and isolation …

Concurrent data structures are widely used in modern multicore architectures, providing
atomicity (linearizability) for each concurrent operation. However, it is often desirable to …

Adjacency lists are frequently used in graphing or map based applications. Although
efficient concurrent linked-list algorithms are well known, it can be difficult to adapt these …

This paper introduces nonblocking transaction composition (NBTC), a new methodology for
atomic composition of nonblocking operations on concurrent data structures. Unlike …