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

Orr Tamir; Adam Morrison; Noam Rinetzky

doi:10.4230/LIPIcs.OPODIS.2015.15

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

Orr Tamir, Adam Morrison, Noam Rinetzky

Tel Aviv University, Technion - Israel Institute of Technology

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	19th International Conference on Principles of Distributed Systems, OPODIS 2015
Editors	Emmanuelle Anceaume, Christian Cachin, Maria Potop-Butucaru
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages	15.1-15.16
ISBN (Electronic)	9783939897989
DOIs	https://doi.org/10.4230/LIPIcs.OPODIS.2015.15
State	Published - 1 Sep 2016
Event	19th International Conference on Principles of Distributed Systems, OPODIS 2015 - Rennes, France Duration: 14 Dec 2015 → 17 Dec 2015

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	46

Conference

Conference	19th International Conference on Principles of Distributed Systems, OPODIS 2015
Country/Territory	France
City	Rennes
Period	14/12/15 → 17/12/15

Keywords

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

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.4230/LIPIcs.OPODIS.2015.15

Cite this

Tamir, O., Morrison, A., & Rinetzky, N. (2016). A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. In E. Anceaume, C. Cachin, & M. Potop-Butucaru (Eds.), 19th International Conference on Principles of Distributed Systems, OPODIS 2015 (pp. 15.1-15.16). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 46). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.OPODIS.2015.15

Tamir, Orr ; Morrison, Adam ; Rinetzky, Noam. / A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. 19th International Conference on Principles of Distributed Systems, OPODIS 2015. editor / Emmanuelle Anceaume ; Christian Cachin ; Maria Potop-Butucaru. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. pp. 15.1-15.16 (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{36b7d9ed7f6348809b086541c226bb64,

title = "A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms",

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.",

keywords = "ChangeKey(), Concurrent data structures, Dijkstra's single-source shortest path algorithm, Priority queues",

author = "Orr Tamir and Adam Morrison and Noam Rinetzky",

note = "Publisher Copyright: {\textcopyright} Orr Tamir, Adam Morrison, and Noam Rinetzky.; 19th International Conference on Principles of Distributed Systems, OPODIS 2015 ; Conference date: 14-12-2015 Through 17-12-2015",

year = "2016",

month = sep,

day = "1",

doi = "10.4230/LIPIcs.OPODIS.2015.15",

language = "الإنجليزيّة",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

pages = "15.1--15.16",

editor = "Emmanuelle Anceaume and Christian Cachin and Maria Potop-Butucaru",

booktitle = "19th International Conference on Principles of Distributed Systems, OPODIS 2015",

address = "ألمانيا",

}

Tamir, O, Morrison, A & Rinetzky, N 2016, A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. in E Anceaume, C Cachin & M Potop-Butucaru (eds), 19th International Conference on Principles of Distributed Systems, OPODIS 2015. Leibniz International Proceedings in Informatics, LIPIcs, vol. 46, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, pp. 15.1-15.16, 19th International Conference on Principles of Distributed Systems, OPODIS 2015, Rennes, France, 14/12/15. https://doi.org/10.4230/LIPIcs.OPODIS.2015.15

A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. / Tamir, Orr; Morrison, Adam ; Rinetzky, Noam.
19th International Conference on Principles of Distributed Systems, OPODIS 2015. ed. / Emmanuelle Anceaume; Christian Cachin; Maria Potop-Butucaru. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2016. p. 15.1-15.16 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 46).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

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

AU - Tamir, Orr

AU - Morrison, Adam

AU - Rinetzky, Noam

N1 - Publisher Copyright: © Orr Tamir, Adam Morrison, and Noam Rinetzky.

PY - 2016/9/1

Y1 - 2016/9/1

N2 - 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.

AB - 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.

KW - ChangeKey()

KW - Concurrent data structures

KW - Dijkstra's single-source shortest path algorithm

KW - Priority queues

UR - http://www.scopus.com/inward/record.url?scp=85013459371&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.OPODIS.2015.15

DO - 10.4230/LIPIcs.OPODIS.2015.15

M3 - منشور من مؤتمر

T3 - Leibniz International Proceedings in Informatics, LIPIcs

SP - 15.1-15.16

BT - 19th International Conference on Principles of Distributed Systems, OPODIS 2015

A2 - Anceaume, Emmanuelle

A2 - Cachin, Christian

A2 - Potop-Butucaru, Maria

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

T2 - 19th International Conference on Principles of Distributed Systems, OPODIS 2015

Y2 - 14 December 2015 through 17 December 2015

ER -

Tamir O, Morrison A , Rinetzky N. A heap-based concurrent priority queue with mutable priorities for faster parallel algorithms. In Anceaume E, Cachin C, Potop-Butucaru M, editors, 19th International Conference on Principles of Distributed Systems, OPODIS 2015. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2016. p. 15.1-15.16. (Leibniz International Proceedings in Informatics, LIPIcs). doi: 10.4230/LIPIcs.OPODIS.2015.15

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

Abstract

Publication series

Conference

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this