An Evaluation of Concurrent Priority Queue Algorithms
The priority queue is a fundamental data structure that is used in a large variety of parallel algorithms, such as multiprocessor scheduling and parallel best-first search of state-space graphs.
Main Author: | Huang, Qin |
---|---|
Other Authors: | Weihl, William E. |
Published: |
2023
|
Online Access: | https://hdl.handle.net/1721.1/149701 |
Similar Items
-
MergeArray and scalable, relaxed, concurrent, mergeable priority queues
by: Coulombe, Michael Joseph
Published: (2015) -
Priority queues /
by: 304138 Jaiswal, N. K.
Published: (1968) -
Accelerating graph algorithms with priority queue processor
by: Heng Sun, Ch'ng, et al.
Published: (2006) -
Accelerating graph algorithms with priority queue processor /
by: Ch'ng, Heng Sun, author, et al.
Published: (2006) -
Boundary-Aware Concurrent Queue: A Fast and Scalable Concurrent FIFO Queue on GPU Environments
by: Md. Sabbir Hossain Polak, et al.
Published: (2025-02-01)