A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
In this paper, we introduce two new FIFO dual queues. Like all dual queues, they arrange for dequeue operations to block when the queue is empty, and to complete in the original order when data becomes available. Compared to alternatives in which dequeues on an empty queue return an error code and force the caller to retry, dual queues provide a valuable guarantee of fairness. Our algorithms, based on the LCRQ of Morrison and Afek, outperform existing dual queues-notably the one indoi:10.1145/2612669.2612711 dblp:conf/spaa/IzraelevitzS14 fatcat:wjxxk2geajay3jz75mb5weomhe