A lock-free priority queue design based on multi-dimensional linked lists

Dechev, Damian; Zhang, Deli

doi:10.1109/TPDS.2015.2419651

Title: A lock-free priority queue design based on multi-dimensional linked lists

Abstract

The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN) for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state ofmore »« less

Authors:

Dechev, Damian ^[1]; Zhang, Deli ^[1]

Univ. of Central Florida, Orlando, FL (United States)

Publication Date:: Fri Apr 03 00:00:00 EDT 2015

Research Org.:: Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

Sponsoring Org.:: USDOE National Nuclear Security Administration (NNSA)

OSTI Identifier:: 1237474

Report Number(s):: SAND-2015-2904J
Journal ID: ISSN 1045-9219; 583295

Grant/Contract Number:: AC04-94AL85000

Resource Type:: Accepted Manuscript

Journal Name:: IEEE Transactions on Parallel and Distributed Systems

Additional Journal Information:: Journal Volume: 27; Journal Issue: 3; Journal ID: ISSN 1045-9219

Publisher:: IEEE

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; concurrent data structure; priority queue; lock-freedom; multi-dimensional list; skiplist

Citation Formats


                    Dechev, Damian, and Zhang, Deli. A lock-free priority queue design based on multi-dimensional linked lists.  United States: N. p., 2015. 
Web.  doi:10.1109/TPDS.2015.2419651.

Copy to clipboard


                    Dechev, Damian, & Zhang, Deli. A lock-free priority queue design based on multi-dimensional linked lists.  United States.  https://doi.org/10.1109/TPDS.2015.2419651

Copy to clipboard


                    Dechev, Damian, and Zhang, Deli. Fri .  
"A lock-free priority queue design based on multi-dimensional linked lists".  United States.  https://doi.org/10.1109/TPDS.2015.2419651.  https://www.osti.gov/servlets/purl/1237474.

Copy to clipboard


                    
@article{osti_1237474,

  title        = {A lock-free priority queue design based on multi-dimensional linked lists},

  author       = {Dechev, Damian and Zhang, Deli},

  abstractNote = {The throughput of concurrent priority queues is pivotal to multiprocessor applications such as discrete event simulation, best-first search and task scheduling. Existing lock-free priority queues are mostly based on skiplists, which probabilistically create shortcuts in an ordered list for fast insertion of elements. The use of skiplists eliminates the need of global rebalancing in balanced search trees and ensures logarithmic sequential search time on average, but the worst-case performance is linear with respect to the input size. In this paper, we propose a quiescently consistent lock-free priority queue based on a multi-dimensional list that guarantees worst-case search time of O(logN) for key universe of size N. The novel multi-dimensional list (MDList) is composed of nodes that contain multiple links to child nodes arranged by their dimensionality. The insertion operation works by first injectively mapping the scalar key to a high-dimensional vector, then uniquely locating the target position by using the vector as coordinates. Nodes in MDList are ordered by their coordinate prefixes and the ordering property of the data structure is readily maintained during insertion without rebalancing nor randomization. Furthermore, in our experimental evaluation using a micro-benchmark, our priority queue achieves an average of 50% speedup over the state of the art approaches under high concurrency.},

  doi          = {10.1109/TPDS.2015.2419651},

  journal      = {IEEE Transactions on Parallel and Distributed Systems},

  number       = 3,

  volume       = 27,

  place        = {United States},

  year         = {Fri Apr 03 00:00:00 EDT 2015},

  month        = {Fri Apr 03 00:00:00 EDT 2015}

}

Copy to clipboard

Journal Article:

Free Publicly Available Full Text

Accepted Manuscript (DOE)

Publisher's Version of Record

https://doi.org/10.1109/TPDS.2015.2419651

Other availability

Search WorldCat to find libraries that may hold this journal

Citation Metrics:

Cited by: 18 works

Citation information provided by
Web of Science

Save / Share:

Export Metadata

Save to My Library

Works referencing / citing this record:

Wait-free Dynamic Transactions for Linked Data Structures
conference, January 2019

LaBorde, Pierre; Lebanoff, Lance; Peterson, Christina
Proceedings of the 10th International Workshop on Programming Models and Applications for Multicores and Manycores - PMAM'19
DOI: 10.1145/3303084.3309491

Similar Records in DOE PAGES and OSTI.GOV collections:

The SprayList: a scalable relaxed priority queue

Journal Article Alistarh, Dan ; Kopinsky, Justin ; Li, Jerry ; ... - SIGPLAN

High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in accessing the elements at the head of the queue in order to perform a DeleteMin operation. In this paper, we present the SprayList, a scalable priority queue with relaxed ordering semantics. Starting from a non-blocking SkipList, the main innovation behind our design is that the DeleteMin operations avoid a sequential bottleneck by ``spraying'' themselves onto the head ofmore »« less
https://doi.org/10.1145/2858788.2688523

Full Text Available
Evaluation of concurrent priority queue algorithms. Technical report

Technical Report Huang, Q

The priority queue is a fundamental data structure that is used in a large variety of parallel algorithms, such as multiprocessor scheduling and parallel best-first search of state-space graphs. This thesis addresses the design and experimental evaluation of two novel concurrent priority queues: a parallel Fibonacci heap and a concurrent priority pool, and compares them with the concurrent binary heap. The parallel Fibonacci heap is based on the sequential Fibonacci heap, which is theoretically the most efficient data structure for sequential priority queues. This scheme not only preserves the efficient operation time bounds of its sequential counterpart, but also hasmore »« less
On RAM priority queues

Conference Thorup, M

Priority queues are some of the most fundamental data structures. They are used directly for, say, task scheduling in operating systems. Moreover, they are essential to greedy algorithms. We study the complexity of priority queue operations on a RAM with arbitrary word size. We present exponential improvements over previous bounds, and we show tight relations to sorting. Our first result is a RAM priority queue supporting insert and extract-min operations in worst case time O(log log n) where n is the current number of keys in the queue. This is an exponential improvement over the O({radical}log n) bound of Redmanmore »« less
Worst-case efficient priority queues

Conference Brodal, G S

An implementation of priority queues is presented that supports the operations MAKEQUEUE, FINDMIN, INSERT, MELD and DECREASEKEY in worst case time O(1) and DFLETEMIN and DELETE in worst case time O(log n). The space requirement is linear. The data structure presented is the first achieving this worst case performance.
Buckets, heaps, lists, and monotone priority queues

Conference Cherkassky, B V ; Goldberg, A V ; Silverstein, C

We introduce the heap-on-top (hot) priority queue data structure that combines the multi-level bucket data structure of Denardo and Fox and a heap. We use the new data structure to obtain an O(m + n(log C){sup 1/3+{epsilon}}) expected time implementation of Dijkstra`s shortest path algorithm, improving the previous bounds. We can implement hot queues even more efficiently in practice by using sorted lists to represent small priority queues. Our experimental results in the context of Dijkstra`s algorithm show that this implementation of hot queues performs very well and is more robust than implementations based only on heap or multi-level bucketmore » data structures.« less

Similar Records

Title: A lock-free priority queue design based on multi-dimensional linked lists

Abstract

Citation Formats

Wait-free Dynamic Transactions for Linked Data Structures conference, January 2019

Wait-free Dynamic Transactions for Linked Data Structures
conference, January 2019