Parallel Priority Queues
Parallel Priority Queues is a parallel data structure that extends the traditional priority queue by enabling concurrent insertion, deletion, and extraction of minimum (or maximum) elements across multiple processing units while maintaining consistency and priority order through synchronization mechanisms.
57
Publications
1.9K
Citations
116
Authors
57
Institutions
Publications per year
2017–2026
2
57
Concurrent access of priority queues
Rao V. Nageshwara, Vipin Kumar · IEEE Transactions on Computers · 1988 · 108 citations
Skiplist-based concurrent priority queues
Nir Shavit, Itay Lotan · 2002 · 99 citations
1–5 of 57
116
4
h-index
3
h-index
3
h-index
2
h-index
2
h-index
1–5 of 116
57
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
8 publications
213 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
3 h-index
3 publications
82 citations
Aalto University
Espoo, Finland
3 h-index
7 publications
178 citations
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo"
Pisa, Italy
3 h-index
5 publications
87 citations
Georgia State University
Atlanta, United States
3 h-index
6 publications
168 citations

University of North Texas
Denton, United States
2 h-index
2 publications
43 citations

University of Pisa
Pisa, Italy
2 h-index
2 publications
33 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
64 citations
1–8 of 57
5 publications · 274 citations
5
h-index
TPDS · 4 publications · 100 citations
4
h-index
PER · 2 publications · 39 citations
2
h-index
2 publications · 31 citations
2
h-index
2 publications · 103 citations
2
h-index
1–5