This web mail archive is frozen.
This page is part of a frozen web archive of this mailing list.
You can still navigate around this archive, but know that no new mails
have been added to it since July of 2016.
Click here to be taken to the new web archives of this list; it includes all the mails that are in this frozen archive plus all new mails that have been sent to the list since it was migrated to the new archives.
On Wed, 2008-03-12 at 18:05 -0400, AurÃ©lien Bouteiller wrote:
> If you can avoid them it is better to avoid them. However it is always
> better to use a MPI_Alltoall than coding your own all to all with
> point to point, and in some algorithms you *need* to make a all to all
> communication. What you should understand by "avoid all to all" is not
> avoid MPI_alltoall, but choose a mathematic algorithm that does not
> need all to all.
> The algorithmic complexity of AllReduce is the same as AlltoAll.
I can't speak for Open-mpi but in the general case this probably isn't
true at least not in the context of how it's meant.
There are two obvious ways to implement AllReduce, either a Reduce/Bcast
combination or the butterfly algorithm. These are both harder to code
than a naive AlltoAll assuming you take into account implementing the
underlying Reduce if you do it that way however the complexity within
collectives is in minimising data contention and in this context I can't
think of anything which is harder than AlltoAll.