Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo,
ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel …

Linearisability is a key correctness criterion for concurrent data structures, ensuring that
each history of the concurrent object under consideration is consistent with respect to a …

This paper describes the first complete implementation of a non-blocking binary search tree
in an asynchronous shared-memory system using single-word compare-and-swap …

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

The throughput of concurrent priority queues is pivotal to multiprocessor applications such
as discrete event simulation, best-first search and task scheduling. Existing lock-free priority …

Modern Datalog engines are employed in industrial applications such as graph-databases,
networks, and static program analysis. To cope with vast amount of data, Datalog engines …

Balanced search trees typically use key comparisons to guide their operations, and achieve
logarithmic running time. By relying on numerical properties of the keys, interpolation search …

In this paper we present a novel algorithm for concurrent lock-free internal binary search
trees (BST) and implement a Set abstract data type (ADT) based on that. We show that in the …

We improve upon an existing non-blocking implementation of a binary search tree from
single-word compare-and-swap instructions. We show that the worst-case amortized step …

Modern Datalog engines are employed in industrial applications such as graph databases,
networks, and static program analysis. To cope with the vast amount of data in these …