论文标题
模块化篮队列
Modular Baskets Queue
论文作者
论文摘要
提出了霍夫曼，沙列夫和莎维特的篮子队列的模块化版本。它使用一个称为Load-Link/增量条件的新颖对象来操纵头和尾部，该对象只能使用读/写入指令来实现，并承认实现传播争议。这表明，在以前的队列实现中，似乎可以替代看似固有的瓶颈，该实现使用单个共享寄存器上的读取模式写入指令来操纵头部和尾巴。
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.
