The SprayList: a scalable relaxed priority queue
High-performance concurrent priority queues are essential for applications such as task scheduling and discrete event simulation. Unfortunately, even the best performing implementations do not scale past a number of threads in the single digits. This is because of the sequential bottleneck in access...
Main Authors: | Alistarh, Dan, Kopinsky, Justin, Li, Jerry Zheng, Shavit, Nir N. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | en_US |
Published: |
Association for Computing Machinery (ACM)
2016
|
Online Access: | http://hdl.handle.net/1721.1/101058 https://orcid.org/0000-0003-2062-0998 https://orcid.org/0000-0002-9937-0049 https://orcid.org/0000-0002-4552-2414 |
Similar Items
-
The SprayList : a scalable relaxed priority queue
by: Li, Jerry Zheng
Published: (2015) -
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
by: Alistarh, Dan, et al.
Published: (2016) -
MergeArray and scalable, relaxed, concurrent, mergeable priority queues
by: Coulombe, Michael Joseph
Published: (2015) -
Inherent limitations of hybrid transactional memory
by: Alistarh, Dan, et al.
Published: (2018) -
ThreadScan: Automatic and Scalable Memory Reclamation
by: Alistarh, Dan, et al.
Published: (2017)