5,350
edits
Parallel Algorithms: Difference between revisions
→Parallel Algorithms
| Line 254: | Line 254: | ||
*** if <math>i \equiv 2^t (\operatorname{mod}2^{t+1})</math> | *** if <math>i \equiv 2^t (\operatorname{mod}2^{t+1})</math> | ||
**** discard(c_i) | **** discard(c_i) | ||
** Time is <math>O(\log n \log k)</math> without pipelining | |||
** With pipelining, complexity is <math>O(\log n + \log k)</math> | |||
===Pipelining=== | ===Pipelining=== | ||