  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.
