Big Chemical Encyclopedia

Chemical substances, components, reactions, process design ...

Articles Figures Tables About

Recursive doubling algorithm

If the number of processes is not a power of two, more than logj p steps are required in the recursive doubling algorithm, and in this case the algorithm can be implemented so that the total number of steps required is bounded by2log2 p. [Pg.52]

Communication pattern and data distribution in all-to-all broadcast using a recursive doubling algorithm involving eight processes, P0-P7. The top part of the figure illustrates the exchange of data between pairs of processes in each step, and the resultant data distribution in each step is shown on the bottom. [Pg.53]

Note that fl is not an immediate result of the equations for A , unlike the previous two algorithms. Howevo, a double recursion may also be defined to compute fl which uses many of the computational terms already defined in... [Pg.63]

See other pages where Recursive doubling algorithm is mentioned: [Pg.52]    [Pg.52]    [Pg.53]    [Pg.105]    [Pg.109]    [Pg.52]    [Pg.52]    [Pg.53]    [Pg.105]    [Pg.109]    [Pg.127]    [Pg.330]    [Pg.142]    [Pg.42]    [Pg.63]    [Pg.164]    [Pg.171]    [Pg.135]   
See also in sourсe #XX -- [ Pg.52 ]



SEARCH



Recursion

Recursion algorithms

Recursive

Recursive algorithm

© 2024 chempedia.info