Modular Baskets Queue
Armando Casta\~neda, Miguel Pi\~na

TL;DR
This paper introduces a modular queue design that uses a novel load-link/increment-conditional object, potentially reducing contention and offering an alternative to traditional read-modify-write based queue implementations.
Contribution
It presents a new modular approach to queues using load-link/increment-conditional objects, enabling contention reduction and alternative implementation strategies.
Findings
Uses only READ/WRITE instructions for manipulation
Allows implementations that spread contention
Suggests an alternative to inherent bottlenecks in previous queues
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 can be implemented using only READ/WRITE instructions, and admits implementations that spread contention. This suggests that there might be an alternative to the seemingly inherent bottleneck in previous queue implementations that manipulate the head and the tail using read-modify-write instructions over a single shared register.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Parallel Computing and Optimization Techniques · Real-Time Systems Scheduling
