- und Kommunikationszentrum der RWTH Aachen
Seffenter Weg 23, D 52074 Aachen (Germany)
From: users-boun...@open-mpi.org [mailto:users-boun...@open-mpi.org] On
Behalf Of Pavel Mezentsev
Sent: Monday, September 24, 2012 3:09 PM
To: Open MPI Users
Subject: Re: [OMPI users] Algorithms used in MPI_
23, D 52074 Aachen (Germany)
> Tel: +49 241 80 24367 -- Fax/UMS: +49 241 80 624367
>
>
> > -Original Message-
> > From: users-boun...@open-mpi.org [mailto:users-boun...@open-mpi.org]
> > On Behalf Of Mohammed El Mehdi DIOURI
> > Sent: Friday, September 21
nt: Friday, September 21, 2012 2:13 AM
> To: us...@open-mpi.org
> Cc: Mohammed El Mehdi DIOURI
> Subject: [OMPI users] Algorithms used in MPI_BCast
>
> Hi,
>
> I would like to know what are the algorithms used in MPI_BCast() in the
> OpenMPI implementation.
>
> For ex
More or less. Open MPI supports 6 algorithms: basic linear, chain, pipeline,
split binary tree, binary tree, binomial tree.
The decision to switch between them is somehow similar to what you describe for
MPICH but more complex it depends on the number of nodes in the communicator
and the size o
Hi,
I would like to know what are the algorithms used in MPI_BCast() in the OpenMPI
implementation.
For example, in MPICH2, depending on the number of processes and the size of
data to broadcast, the broadcasting algorithm used can be different : a
binomial tree if the message is short or MP
