Abstract Software Transactional Memory Systems (STM) are a promising alternative for
concurrency control in shared memory systems. Multiversion STM systems maintain multiple …

The notion of a universal construction is central in computing science: the wheel has not to
be reinvented for each new problem. In the context of n-process asynchronous distributed …

Transactional Memory (TM) provides a strong abstraction to tackle the challenge of
synchronizing concurrent tasks that access shared state. Yet, most TMs do not allow a single …

Transactional memory promises to make concurrent programming tractable and efficient by
allowing the user to assemble sequences of actions in atomic transactions with all-or …

Transactional memory allows the user to declare sequences of instructions as speculative
transactions that can either commit or abort, providing all-or-nothing semantics. If a …

The paper presents the first concurrency-optimal implementation of a binary search tree
(BST). The implementation, based on a standard sequential implementation of a partially …

Transactional memory (TM) is a convenient synchronization tool that allows concurrent
threads to declare sequences of instructions on shared data as speculative transactions …

In this paper, we describe an enhanced Automatic Checkpointing and Partial Rollback
algorithm (CaPR+) to realize Software Transactional Memory (STM) that is based on …

The rise of multi-core systems has necessitated the need for concurrent programming.
However, developing correct, efficient concurrent programs is notoriously difficult. Software …

Abstract Several Hybrid Transactional Memory (HyTM) schemes have recently been
proposed to complement the fast, but best-effort nature of Hardware Transactional Memory …