Fast and lock-free concurrent priority queues for multi-thread systems
- 1 May 2005
- journal article
- Published by Elsevier BV in Journal of Parallel and Distributed Computing
- Vol. 65 (5), 609-627
- https://doi.org/10.1016/j.jpdc.2004.12.005
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Lock-free linked lists and skip listsPublished by Association for Computing Machinery (ACM) ,2004
- Priority queues and sorting methods for parallel simulationIEEE Transactions on Software Engineering, 2000
- An efficient algorithm for concurrent priority queue heapsInformation Processing Letters, 1996
- Efficient wait-free implementation of a concurrent priority queueLecture Notes in Computer Science, 1993
- Wait-free synchronizationACM Transactions on Programming Languages and Systems, 1991
- Linearizability: a correctness condition for concurrent objectsACM Transactions on Programming Languages and Systems, 1990
- Skip lists: a probabilistic alternative to balanced treesCommunications of the ACM, 1990
- Priority inheritance protocols: an approach to real-time synchronizationIEEE Transactions on Computers, 1990
- Concurrent operations on priority queuesCommunications of the ACM, 1989