Boost Lock-free Queue and Stack with Batching
Concurrent queues and stacks are important components of many software systems. They are well-known contended data structures due to intense contention on hotspots, resulting in limited performance and poor scalability. To achieve higher performance, several attempts applied the batching technique, which packs a group of standard operations into a single batch for execution, to lock-free queues and stacks built upon the linked list, but still inherited the contended compare-and-swap (CAS).
Authors
- W. P. Li (ORCID: https://orcid.org/0000-0003-1663-2996)
- Yuan Chen (ORCID: https://orcid.org/0009-0005-8167-1854)
- Linfeng Deng
- A Li (ORCID: https://orcid.org/0009-0000-9703-2671)
Institutions
- Wuhan University (CN)
Publication Details
- Published
- 2025-02-28
- DOI
- https://doi.org/10.1145/3710848.3710880
- Citations
- 1
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 1.49