Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912809718120448 |
|---|---|
| author | Singh, Ajay Metaxakis, Nikos Fatourou, Panagiota |
| author_facet | Singh, Ajay Metaxakis, Nikos Fatourou, Panagiota |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_04523 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks Singh, Ajay Metaxakis, Nikos Fatourou, Panagiota Distributed, Parallel, and Cluster Computing Programming Languages D.1.3 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. |
| title | Sharded Elimination and Combining for Highly-Efficient Concurrent Stacks |
| topic | Distributed, Parallel, and Cluster Computing Programming Languages D.1.3 |
| url | https://arxiv.org/abs/2601.04523 |