CBPQ: High Performance Lock-Free Priority Queue
Authors:
- Anastasia BraginskyABAnastasia Braginsky
- Nachshon CohenNCNachshon Cohen
- Erez PetrankEPErez Petrank
- 9 August 2016
- book chapter
- Published by Springer Nature
- p. 460-474
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Automatic memory reclamation for lock-free data structures2015
- Reclaiming Memory for Lock-Free Data Structures2015
- The Adaptive Priority Queue with Elimination and Combining2014
- Drop the anchor2013
- Locality-Conscious Lock-Free Linked ListsLecture Notes in Computer Science, 2011
- A scalable lock-free stack algorithmJournal of Parallel and Distributed Computing, 2010
- Optimization techniques for concurrent STM-based implementations: A concurrent binary heap as a case study2009
- A Pragmatic Implementation of Non-blocking Linked-lists2001
- An efficient algorithm for concurrent priority queue heapsInformation Processing Letters, 1996
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991