Recursive Doubling

Recursive Doubling is a collective communication algorithm in parallel computing that belongs to the class of broadcast or reduction methods, distinguished by its iterative process in which each participating processor doubles the number of nodes it communicates with in each step, effectively spanning the entire processor set in logarithmic time.

19

Publications

802

Citations

40

Authors

25

Institutions

Publications per year

2017–2026

0

Authors

40

  1. JD
    John D. Owens

    University of California, Davis, United States

    2 publications · 289 citations

    2

    h-index

  2. JC
    Jonathan Cohen

    University College London, United Kingdom

    2 publications · 289 citations

    2

    h-index

  3. YZ
    Yao Zhang

    University of California, Davis, United States

    2 publications · 289 citations

    2

    h-index

  4. GN
    Ge Nong

    Sun Yat-sen University, China

    1 publications · 12 citations

    1

    h-index

  5. MA
    Masoud Amin-Javaheri

    The Ohio State University, United States

    1 publications · 11 citations

    1

    h-index

1–5 of 40

Venues

  1. IEEE Transactions on Computers

    2 publications · 28 citations

    2

    h-index

  2. Algebra Universalis

    1 publications · 23 citations

    1

    h-index

  3. ACM SIGPLAN Notices

    1 publications · 77 citations

    1

    h-index

  4. Journal of the Optical Society of America A

    1 publications · 21 citations

    1

    h-index

  5. Telecommunication Systems

    1 publications · 20 citations

    1

    h-index

1–5