POSTER: wCQ: A Fast Wait-Free Queue with Bounded Memory Usage
| dc.contributor.author | Nikolaev, Ruslan | en |
| dc.contributor.author | Ravindran, Binoy | en |
| dc.date.accessioned | 2023-03-07T13:31:20Z | en |
| dc.date.available | 2023-03-07T13:31:20Z | en |
| dc.date.issued | 2022-04-02 | en |
| dc.date.updated | 2022-10-20T13:42:29Z | en |
| dc.description.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. | en |
| dc.description.version | Published version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.doi | https://doi.org/10.1145/3503221.3508440 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/114051 | en |
| dc.language.iso | en | en |
| dc.publisher | ACM | en |
| dc.rights | In Copyright | en |
| dc.rights.holder | The author(s) | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.title | POSTER: wCQ: A Fast Wait-Free Queue with Bounded Memory Usage | en |
| dc.type | Article - Refereed | en |
| dc.type.dcmitype | Text | en |