2016 45th International Conference on Parallel Processing (ICPP) (2016)
Philadelphia, PA, USA
Aug. 16, 2016 to Aug. 19, 2016
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2016.32
We introduce a new algorithm for an unbounded concurrent double-ended queue (deque). Like the bounded deque of Herlihy, Luchangco, and Moir on which it is based, the new algorithm is simple and obstruction free, has no pathological long-latency scenarios, avoids interference between operations at opposite ends, and requires no special hardware support beyond the usual compare-and-swap. To the best of our knowledge, no prior concurrent deque combines these properties with unbounded capacity, or provides consistently better performance across a wide range of concurrent workloads.
Arrays, Protocols, Radiation detectors, Indexes, Containers, Parallel processing, Interference
M. Graichen, J. Izraelevitz and M. L. Scott, "An Unbounded Nonblocking Double-Ended Queue," 2016 45th International Conference on Parallel Processing (ICPP), Philadelphia, PA, USA, 2016, pp. 217-226.