@inproceedings{07f1cf8804b84df1b97679a212e3f5d9,
title = "CBPQ: High performance lock-free priority queue",
abstract = "Priority queues are an important algorithmic component and are ubiquitous in systems and software. With the rapid deployment of parallel platforms, concurrent versions of priority queues are becoming increasingly important. In this paper, we present a novel concurrent lock-free linearizable algorithm for priority queues that scales significantly better than all known (lock-based or lock-free) priority queues. Our design employs several techniques to obtain its advantages including lock-free chunks, the use of the efficient fetch-and-increment atomic instruction, and elimination. Measurements under high contention demonstrate performance improvement by up to a factor of 1.8 over existing approaches.",
keywords = "Freezing, Lock-free, Non-blocking, Performance, Priority queue",
author = "Anastasia Braginsky and Nachshon Cohen and Erez Petrank",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing Switzerland 2016.; 22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016 ; Conference date: 24-08-2016 Through 26-08-2016",
year = "2016",
doi = "10.1007/978-3-319-43659-3\_34",
language = "الإنجليزيّة",
isbn = "9783319436586",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "460--474",
editor = "Pierre-Fran{\c c}ois Dutot and Denis Trystram",
booktitle = "Parallel Processing - 22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016, Proceedings",
}