Hi,
Am 05.06.2012 um 15:39 schrieb Mudassar Majeed:
>Let say there are N MPI processes. Each MPI process
> has to communicate with some T processes, where T < N. This information is a
> directed graph (and every process knows only about its own). I need to
> convert it
You need to use 2 calls. One option is an Allgather followed by an
Allgatherv.
Allgather() with one integer, which is the number of nodes the rank is
linked to
Allgatherv() with a variable size array of integers where each entry is
a connected to node
On 06/05/2012 08:39 AM, Mudassar Maje
Dear people,
Let say there are N MPI processes. Each MPI process has
to communicate with some T processes, where T < N. This information is a
directed graph (and every process knows only about its own). I need to convert
it to undirected graph, so that each process will
