Parallel Prefix Computation

Parallel Prefix Computation is a fundamental algorithmic operation in parallel computing that belongs to the class of collective communication patterns, distinguished by its computation of all partial prefix results of a given associative binary operation over an ordered sequence of input elements in parallel.

215

Publications

9.4K

Citations

416

Authors

196

Institutions

Publications per year

2017–2026

34

Authors

416

  1. YL
    Yen‐Chun Lin

    Chiayi Chang Gung Memorial Hospital, Taiwan

    9 publications · 152 citations

    10

    h-index

  2. HV
    H.T. Vergos

    University of Patras, Greece

    8 publications · 519 citations

    8

    h-index

  3. CE
    C. Efstathiou

    National and Kapodistrian University of Athens, Greece

    7 publications · 459 citations

    7

    h-index

  4. DN
    D. Nikolos

    University of Patras, Greece

    8 publications · 601 citations

    7

    h-index

  5. GD
    Giorgos Dimitrakopoulos

    Democritus University of Thrace, Greece

    5 publications · 255 citations

    5

    h-index

1–5 of 416

Venues

  1. IEEE Transactions on Computers

    16 publications · 1.4K citations

    16

    h-index

  2. Journal of Parallel and Distributed Computing

    10 publications · 297 citations

    10

    h-index

  3. 6

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 6 publications · 210 citations

    6

    h-index

  5. Information Processing Letters

    5 publications · 115 citations

    5

    h-index

1–5