Non-blocking data structures are often analysed by giving an upper amortised running time
bound in terms of the size of the data structure and a measure of contention. The two most …

This paper presents a fast concurrent binary search tree algorithm. To achieve high
performance under contention, the algorithm divides update operations within an eager …

Reproducibility of experiments is key to research advances. Unfortunately, experiments
involving concurrent programs are rarely reproducible. In this paper, we focus on multi …

Measuring concurrency. Multicore applications require highly concurrent data structures.
Yet, the very notion of concurrency is vaguely defined, to say the least. What is meant by a …

Designing an efficient concurrent data structure is a challenge that is not easy to meet.
Intuitively, efficiency of an implementation is defined, in the first place, by its ability to process …

Designing a concurrent data structure faces with a number of problems, one of which is the
use of locks in the implementation, namely their number and location. On the one hand …

The multicore revolution of the early 21st century has introduced a multitude of
multiprocessor synchronization techniques for designing concurrent data structures. This …

Traditional techniques for synchronization are based on\emph {locking} that provides
threads with exclusive access to shared data.\emph {Coarse-grained} locking typically …