1. CBPQ: High Performance Lock-Free Priority Queue
- Author
-
Nachshon Cohen, Anastasia Braginsky, and Erez Petrank
- Subjects
Record locking ,Queue management system ,Computer science ,Distributed computing ,020207 software engineering ,0102 computer and information sciences ,02 engineering and technology ,01 natural sciences ,Deadline-monotonic scheduling ,Priority inheritance ,010201 computation theory & mathematics ,0202 electrical engineering, electronic engineering, information engineering ,Non-blocking algorithm ,Double-ended priority queue ,Priority ceiling protocol ,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 upi?źto a factor of 1.8 over existing approaches.
- Published
- 2016