Year: 2025
Type: conference-paper
Abstract: A modular version of the baskets queue of Hoffman, Shalev and Shavit is presented. It manipulates the head and tail using a novel object called load-link/increment-conditional, which admits implementations based solely on READ/WRITE instructions, as well as versions that internally use CAS. These variants offer flexibility in balancing simplicity and performance, and admits implementations that spread contention. While other components of the queue still require stronger atomic primitives such as CAS or FAI, this separation highlights the potential for designs that mitigate the seemingly inherent bottleneck in previous queue implementations that manipulate the head and tail using read-modify-write (RMW) instructions over a single shared register.
Authors: Miguel Piña, Armando Castañeda
Institution: Universidad Nacional Autónoma de México
Language: English
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
OpenAlex ID: W4411979459