5,350
edits
Parallel Algorithms: Difference between revisions
no edit summary
No edit summary |
|||
| Line 43: | Line 43: | ||
* Good serial algorithms: Poly time | * Good serial algorithms: Poly time | ||
* Good parallel algorithm: poly-log <math>O(\log ^c n)</math> time, poly processors | * Good parallel algorithm: poly-log <math>O(\log ^c n)</math> time, poly processors | ||
==Technique: Balanced Binary Trees== | |||
Example Applications: | |||
* Prefix sum | |||
* Largest element | |||
* Nearest-one element | |||