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

Authors

116

  1. SK
    Sushil K. Prasad

    Georgia State University, United States

    4 publications · 118 citations

    4

    h-index

  2. EH
    Esa Hyytiä

    Aalto University, Finland

    3 publications · 72 citations

    3

    h-index

  3. CM
    Cristina M. Pinotti

    University of Perugia, Italy

    3 publications · 61 citations

    3

    h-index

  4. JS
    Jay Sethuraman

    Columbia University, United States

    2 publications · 71 citations

    2

    h-index

  5. GS
    Gerth Stølting Brodal

    Aarhus University, Denmark

    2 publications · 93 citations

    2

    h-index

1–5 of 116

Venues

  1. Journal of Parallel and Distributed Computing

    5 publications · 274 citations

    5

    h-index

  2. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 100 citations

    4

    h-index

  3. ACM SIGMETRICS Performance Evaluation Review

    PER · 2 publications · 39 citations

    2

    h-index

  4. Theoretical Computer Science

    2 publications · 31 citations

    2

    h-index

  5. The Journal of Supercomputing

    2 publications · 103 citations

    2

    h-index

1–5