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 (Author), Kopinsky, Justin (Contributor), Li, Jerry Zheng (Contributor), Shavit, Nir N. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor) |
Format: | Article |
Language: | English |
Published: |
Association for Computing Machinery (ACM),
2016-02-02T13:02:12Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
The SprayList : a scalable relaxed priority queue
by: Li, Jerry Zheng
Published: (2015) -
MergeArray and scalable, relaxed, concurrent, mergeable priority queues
by: Coulombe, Michael Joseph
Published: (2015) -
The LevelArray: A Fast, Practical Long-Lived Renaming Algorithm
by: Alistarh, Dan, et al.
Published: (2016) -
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)