Transactions with strong consistency and high availability simplify building and reasoning
about distributed systems. However, previous implementations performed poorly. This …

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

Modern GPUs have shown promising results in accelerating computation intensive and
numerical workloads with limited dynamic data sharing. However, many real-world …

Data races complicate programming language semantics, and a data race is often a bug.
Existing techniques detect data races and define their semantics by detecting conflicts …

Herlihy and Koskinen's transactional boosting methodology addressed the challenge of
converting concurrent data structures into transactional ones. We present an optimistic …

Multicore systems should support both speculative and non-speculative parallelism.
Speculative parallelism is easy to use and is crucial to scale many challenging applications …

Software transactional memory offers an appealing alternative to locks by improving
programmability, reliability, and scalability. However, existing STMs are impractical because …

In this paper we provide a high performance solution to the problem of committing
transactions while enforcing a pre-defined order. We provide the design and implementation …

Speculation is a well-known means of increasing parallelism among concurrent methods
that are usually but not always independent. Traditional nonblocking data structures employ …

Correctly synchronizing multithreaded programs is challenging and errors can lead to
program failures such as atomicity violations. Existing strong memory consistency models …