TY - GEN
T1 - POSTER
T2 - 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2022
AU - Nikolaev, Ruslan
AU - Ravindran, Binoy
N1 - Publisher Copyright:
© 2022 Owner/Author.
PY - 2022/4/2
Y1 - 2022/4/2
N2 - The concurrency literature presents a number of approaches for building non-blocking, FIFO, multiple-producer and multiple-consumer (MPMC) queues. However, existing wait-free queues are either not very scalable or suffer from potentially unbounded memory usage. We present a wait-free queue, wCQ, which uses its own variation of the fast-path-slow-path methodology to attain wait-freedom and bound memory usage. wCQ is memory efficient and its performance is often on par with the best known concurrent queue designs.
AB - The concurrency literature presents a number of approaches for building non-blocking, FIFO, multiple-producer and multiple-consumer (MPMC) queues. However, existing wait-free queues are either not very scalable or suffer from potentially unbounded memory usage. We present a wait-free queue, wCQ, which uses its own variation of the fast-path-slow-path methodology to attain wait-freedom and bound memory usage. wCQ is memory efficient and its performance is often on par with the best known concurrent queue designs.
UR - http://www.scopus.com/inward/record.url?scp=85127591851&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85127591851&partnerID=8YFLogxK
U2 - 10.1145/3503221.3508440
DO - 10.1145/3503221.3508440
M3 - Conference contribution
AN - SCOPUS:85127591851
T3 - Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP
SP - 461
EP - 462
BT - PPoPP 2022 - Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
PB - Association for Computing Machinery
Y2 - 2 April 2022 through 6 April 2022
ER -