@inproceedings{10898,
  abstract     = {A prominent remedy to multicore scalability issues in concurrent data structure implementations is to relax the sequential specification of the data structure. We present distributed queues (DQ), a new family of relaxed concurrent queue implementations. DQs implement relaxed queues with linearizable emptiness check and either configurable or bounded out-of-order behavior or pool behavior. Our experiments show that DQs outperform and outscale in micro- and macrobenchmarks all strict and relaxed queue as well as pool implementations that we considered.},
  author       = {Haas, Andreas and Lippautz, Michael and Henzinger, Thomas A and Payer, Hannes and Sokolova, Ana and Kirsch, Christoph M. and Sezgin, Ali},
  booktitle    = {Proceedings of the ACM International Conference on Computing Frontiers - CF '13},
  isbn         = {978-145032053-5},
  location     = {Ischia, Italy},
  number       = {5},
  publisher    = {ACM Press},
  title        = {{Distributed queues in shared memory: Multicore performance and scalability through quantitative relaxation}},
  doi          = {10.1145/2482767.2482789},
  year         = {2013},
}