Hi Ghislain,
I tried to run your test with mvapich 1.9 and get a "message truncated"
failure at three ranks.
Howard
2014-11-20 8:51 GMT-07:00 Ghislain Viguier :
> Dear support,
>
> I'm encountering an issue with the MPI_Neighbor_alltoallw request of
> mpi-1.8.3.
> I have enclosed a test case w
For further information, the test also fails with MPI-1.8.4rc1.
2014-11-20 16:51 GMT+01:00 Ghislain Viguier :
> Dear support,
>
> I'm encountering an issue with the MPI_Neighbor_alltoallw request of
> mpi-1.8.3.
> I have enclosed a test case with information of my workstation.
>
> In this test,
Dear support,
I'm encountering an issue with the MPI_Neighbor_alltoallw request of
mpi-1.8.3.
I have enclosed a test case with information of my workstation.
In this test, I define a weighted topology for 5 processes, where the
weight represent the number of buffers to send/receive :
rank
For those of you who weren't able to be at the SC'14 BOF yesterday -- and even
for those of you who were there and wanted to be able to read the slides in a
little more detail (and get the links from the slides) -- I have posted them
here:
http://www.open-mpi.org/papers/sc-2014/
Enjoy!
--
It wouldn’t be maffinity - that just tells the OS on a single node to ensure
that the memory is local to the process.
If you have a managed environment (i.e., there is a scheduler running that
assigns nodes to jobs), then you would need to configure the scheduler to
support that option (assumin
Gilles,
Thanx for the valuable information. So this solves part of the puzzle. The
next thing is know the cost of these algorithms. Some of them seem to be
standard, however, I am afraid there could be some modifications that will
ultimately alter the cost. Hence I asked for a paper.
I will
Since there is no way to share memory across nodes is there a way to tell
openmpi to run memory intensive
Processes on nodes with a lot of memory?
I think that it is called “maffinity”, but am not sure how to use it.
With Blessings, always,
Jerry Mersel
[cid:image003.png@01CF80E7.62B7D810]
