A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms

Orr Tamir, Adam Morrison, Noam Rinetzky. A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms. In Emmanuelle Anceaume, Christian Cachin, Maria Gradinariu Potop-Butucaru, editors, 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France. Volume 46 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]

@inproceedings{TamirMR15,
  title = {A Heap-Based Concurrent Priority Queue with Mutable Priorities for Faster Parallel Algorithms},
  author = {Orr Tamir and Adam Morrison and Noam Rinetzky},
  year = {2015},
  doi = {10.4230/LIPIcs.OPODIS.2015.15},
  url = {http://dx.doi.org/10.4230/LIPIcs.OPODIS.2015.15},
  researchr = {https://researchr.org/publication/TamirMR15},
  cites = {0},
  citedby = {0},
  booktitle = {19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14-17, 2015, Rennes, France},
  editor = {Emmanuelle Anceaume and Christian Cachin and Maria Gradinariu Potop-Butucaru},
  volume = {46},
  series = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  isbn = {978-3-939897-98-9},
}