Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks

TL;DR

This paper introduces a highly efficient concurrent stack implementation using sharding, elimination, and combining techniques, achieving up to twice the performance of existing stacks especially in high contention and multi-threaded environments.

Contribution

The paper presents a novel blocking linearizable stack design that integrates sharding with elimination and combining methods for improved performance.

Findings

Outperforms existing concurrent stacks by up to 2X in most workloads.

Achieves high parallelism and low contention in multi-threaded scenarios.

Excels particularly in systems with many threads and high contention.

Abstract

We present a new blocking linearizable stack implementation which utilizes sharding and fetch&increment to achieve significantly better performance than all existing concurrent stacks. The proposed implementation is based on a novel elimination mechanism and a new combining approach that are efficiently blended to gain high performance. Our implementation results in enhanced parallelism and low contention when accessing the shared stack. Experiments show that the proposed stack implementation outperforms all existing concurrent stacks by up to 2X in most workloads. It is particularly efficient in systems supporting a large number of threads and in high contention scenarios.