77ef979457
description. Most of the bcast algorithms can be completed using this generic function once we create the tree structure. Add all kind of trees. There are 2 versions of the generic bcast function. One using overlapping between receives (for intermediary nodes) and then blocking sends to all childs and another where all sends are non blocking. I still have to figure out which one give the smallest overhead. This commit was SVN r12530. |
||
|---|---|---|
| .. | ||
| base | ||
| basic | ||
| demo | ||
| hierarch | ||
| libnbc | ||
| self | ||
| sm | ||
| tuned | ||
| coll.h | ||
| Makefile.am | ||