We introduce the first binary search tree algorithm designed for speculative executions. Prior
to this work, tree structures were mainly designed for their pessimistic (non-speculative) …

This paper presents a non-blocking Patricia trie implementation for an asynchronous shared-
memory system using Compare&Swap. The trie implements a linearizable set and supports …

Efficient communication and synchronization is crucial for fine grained parallelism. Libraries
providing such features, while indispensable, are difficult to write, and often cannot be …

Concurrency control poses significant challenges when composing computations over
multiple data-structures (objects) with different concurrency-control implementations. We …

Abstract The Holy Grail of parallel programming is to provide good speedup while hiding or
avoiding the pitfalls of concurrency. But some level in the tower of abstraction must face …

As the classic transactional abstraction is sometimes considered too restrictive in leveraging
parallelism, a lot of work has been devoted to devising relaxed transactional models with the …

Composing together the individual atomic methods of concurrent data-structures (cds) pose
multiple design and consistency challenges. In this context composition provided by …

Highly concurrent and reliable data objects are vital for parallel programming. Lock-free
shared data objects are highly concurrent and guarantee that at least one operation, from a …

This thesis provides an in-depth discussion of task scheduling for shared memory systems.
The topic is approached in a vertical manner, starting with high-level programming model …

Here, we propose a new approach to design non-blocking algorithms that can apply multiple
changes to a shared data structure atomically using Compare&Swap (CAS) instructions. We …