POSTER: wCQ: A FastWait-Free Queue with Bounded Memory Usage

Ruslan Nikolaev, Binoy Ravindran

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Scopus citations

Abstract

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.

Original languageEnglish (US)
Title of host publicationPPoPP 2022 - Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
PublisherAssociation for Computing Machinery
Pages461-462
Number of pages2
ISBN (Electronic)9781450392044
DOIs
StatePublished - Apr 2 2022
Event27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2022 - Virtual, Online, Korea, Republic of
Duration: Apr 2 2022Apr 6 2022

Publication series

NameProceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Conference

Conference27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2022
Country/TerritoryKorea, Republic of
CityVirtual, Online
Period4/2/224/6/22

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'POSTER: wCQ: A FastWait-Free Queue with Bounded Memory Usage'. Together they form a unique fingerprint.

Cite this