Brief announcement

Joseph Izraelevitz, Michael L. Scott
2014 Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures - SPAA '14  
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 in
more » ... current-by a factor of four to six. For both of our algorithms, we present extensions that guarantee lock freedom, albeit at some cost in performance.
doi:10.1145/2612669.2612711 dblp:conf/spaa/IzraelevitzS14 fatcat:wjxxk2geajay3jz75mb5weomhe