- T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms, 2nd edition. MIT Press and McGraw-Hill Book Company, 2001. Google Scholar
Digital Library
- T. Harris, K. Fraser, and I. Pratt. A Practical Multi-word Compare-and-Swap Operation. In Proceedings of the 16th International Conference on Distributed Computing, Toulouse, France, Oct. 2002. Google Scholar
Digital Library
- M. P. Herlihy and J. M. Wing. Linearizability: a Correctness Condition for Concurrent Objects. ACM Transactions on Programming Languages and Systems, 12 (3): 463--492, 1990. Google Scholar
Digital Library
- G. Hunt, M. Michael, S. Parthasarathy, and M. Scott. An Efficient Algorithm for Concurrent Priority Queue Heaps. Information Processing Letters, 60: 151--157, Nov. 1996. Google Scholar
Digital Library
- Y. Liu and M. Spear. A Lock-Free, Array-Based Priority Queue. Technical Report LU-CSE-11-003, Lehigh University, 2011.Google Scholar
- I. Lotan and N. Shavit. Skiplist-Based Concurrent Priority Queues. In Proceedings of the 14th International Parallel and Distributed Processing Symposium, Cancun, Mexico, May 2000. Google Scholar
Digital Library
Index Terms
A lock-free, array-based priority queue
Recommendations
A lock-free, array-based priority queue
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel ProgrammingFast and Lock-Free Concurrent Priority Queues for Multi-Thread Systems
IPDPS '03: Proceedings of the 17th International Symposium on Parallel and Distributed ProcessingWe present an efficient and practical lock-free implementation of a concurrent priority queue that is suitable for both fully concurrent (large multi-processor) systems as well as pre-emptive (multi-process) systems. Many algorithms for concurrent ...
Mounds: Array-Based Concurrent Priority Queues
ICPP '12: Proceedings of the 2012 41st International Conference on Parallel ProcessingThis paper introduces a concurrent data structure called the mound. The mound is a rooted tree of sorted lists that relies on randomization for balance. It supports O(log(log(N))) insert and O(log(N)) extract Min operations, making it suitable for use ...








Comments