Hi,
The first "crash" is OK, since your rankfile has ranks 0 and 1 defined,
while n=1, which means only rank 0 is present and can be allocated.
NP must be >= the largest rank in rankfile.
What exactly are you trying to do ?
I tried to recreate your seqv but all I got was
~/work/svn/ompi/trunk/
I am curious about the algorithm(s) used in the OpenMPI implementations
of the all2all and all2allv. As many of you know, there are alternate
algorithms for all2all type operations, such as that of Plimpton, et al
(2006), that basically exchange latency costs for bandwidth costs, which
pays big di
