CBPQ: High performance lock-free priority queue

Anastasia Braginsky, Nachshon Cohen, Erez Petrank

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

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.

Original languageEnglish
Title of host publicationParallel Processing - 22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016, Proceedings
EditorsPierre-François Dutot, Denis Trystram
Pages460-474
Number of pages15
DOIs
StatePublished - 2016
Event22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016 - Grenoble, France
Duration: 24 Aug 201626 Aug 2016

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9833 LNCS

Conference

Conference22nd International Conference on Parallel and Distributed Computing, Euro-Par 2016
Country/TerritoryFrance
CityGrenoble
Period24/08/1626/08/16

Keywords

  • Freezing
  • Lock-free
  • Non-blocking
  • Performance
  • Priority queue

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'CBPQ: High performance lock-free priority queue'. Together they form a unique fingerprint.

Cite this