Nikolaev, RuslanRavindran, Binoy2023-03-072023-03-072022-04-02http://hdl.handle.net/10919/114051The 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.application/pdfenIn CopyrightArticle - Refereed2022-10-20The author(s)https://doi.org/10.1145/3503221.3508440