[mpich-discuss] MPI_Allgatherv complexity

[Rajeev Thakur]

You can see the algorithms used for different messages sizes in MPICH2
here:
https://svn.mcs.anl.gov/repos/mpi/mpich2/trunk/src/mpi/coll/allgatherv.c
, but Cray could be using a modified version. What is the total message
size being gathered and how many processes are you running on?
 
Rajeev
 


  _____  

From: mpich-discuss-bounces at mcs.anl.gov
[mailto:mpich-discuss-bounces at mcs.anl.gov] On Behalf Of Justin Luitjens
Sent: Monday, November 02, 2009 5:59 PM
To: mpich-discuss at mcs.anl.gov
Subject: [mpich-discuss] MPI_Allgatherv complexity


Hi,

I'm wondering what is the parallel complexity of MPI_Allgatherv.  I
would suspect in the worst case it would be something like N log P but
from the timings i'm collecting this doesn't seem to be the case.  I'm
running tests on Kraken
(http://www.nics.tennessee.edu/computing-resources/kraken 
) and it looks like it might be something like P log P.

Thanks,

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.mcs.anl.gov/pipermail/mpich-discuss/attachments/20091102/b000dcae/attachment-0001.htm>