may find useful.
Hope this helps.
-bill
From: users-boun...@open-mpi.org [mailto:users-boun...@open-mpi.org] On
Behalf Of Alexandru Blidaru
Sent: Tuesday, July 20, 2010 10:54 AM
To: Open MPI Users
Subject: Re: [OMPI users] Partitioning problem set data
If there is an already existing imple
Hope this helps.
>
>
>
> -bill
>
>
>
>
>
> *From:* users-boun...@open-mpi.org [mailto:users-boun...@open-mpi.org] *On
> Behalf Of *Alexandru Blidaru
> *Sent:* Tuesday, July 20, 2010 10:54 AM
> *To:* Open MPI Users
> *Subject:* Re: [OMPI users] Partitioning proble
n-mpi.org] On Behalf
Of Alexandru Blidaru
Sent: Tuesday, July 20, 2010 10:54 AM
To: Open MPI Users
Subject: Re: [OMPI users] Partitioning problem set data
If there is an already existing implementation of the *Block or Block* methods
that splits the array and sends the individual pieces to the proper
The reason so many different distributions are described is because
what is optimal depends so much on your own case.
Even if one disregards CYCLIC axes, there are still all those BLOCK
choices you mention. It isn't just a matter of choosing which axes
will be * since * is just a special case
If there is an already existing implementation of the *Block or Block*
methods that splits the array and sends the individual pieces to
the proper nodes, can you point me to it please?
On Tue, Jul 20, 2010 at 9:52 AM, Alexandru Blidaru wrote:
> Hi,
>
> I have a 3D array, which I need to split int
Hi,
I have a 3D array, which I need to split into equal n parts, so that each
part would run on a different node. I found the picture in the attachment
from this website (
https://computing.llnl.gov/tutorials/parallel_comp/#DesignPartitioning) on
the different ways to partition data. I am interest
