Parallel Algorithms: Difference between revisions

Line 260: Line 260:
* There are <math>\log k</math> waves of the absorb procedure.
* There are <math>\log k</math> waves of the absorb procedure.
* Apply pipelining to make the time <math>O(\log n + \log k)</math>
* Apply pipelining to make the time <math>O(\log n + \log k)</math>
==Maximum Finding==


==Resources==
==Resources==