A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Existing concurrent priority queues do not allow to update the priority of an element after its insertion. As a result, algorithms that need this functionality, such as Dijkstra's single source shortest path algorithm, resort to cumbersome and inefficient workarounds. We report on a heap-based concurrent priority queue which allows to change the priority of an element after its insertion. We show that the enriched interface allows to express Dijkstra's algorithm in a more natural way, and that its implementation, using our concurrent priority queue, outperform existing algorithms.

Original languageEnglish
Title of host publication19th International Conference on Principles of Distributed Systems, OPODIS 2015
EditorsEmmanuelle Anceaume, Christian Cachin, Maria Potop-Butucaru
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages15.1-15.16
ISBN (Electronic)9783939897989
DOIs
StatePublished - 1 Sep 2016
Event19th International Conference on Principles of Distributed Systems, OPODIS 2015 - Rennes, France
Duration: 14 Dec 201517 Dec 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume46
ISSN (Print)1868-8969

Conference

Conference19th International Conference on Principles of Distributed Systems, OPODIS 2015
Country/TerritoryFrance
CityRennes
Period14/12/1517/12/15

Funding

FundersFunder number
Broadcom Foundation
EU FP7308830
Israel Science Foundation1749/14, 652/11, 1227/10
Yad Hanadiv Foundation
European Research Council321174-VSSC
Tel Aviv University

    Keywords

    • ChangeKey()
    • Concurrent data structures
    • Dijkstra's single-source shortest path algorithm
    • Priority queues

    Fingerprint

    Dive into the research topics of 'A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms'. Together they form a unique fingerprint.

    Cite this