Thanks for everyone who answered my question.
I have fixed the problem. In my codes, for each communication, a process
would first send the length of message and then the content of the message.
To check whether previous communication succeed, I only checked whether the
content have been sent. In
Well, if it is the next message then I guess you have a bug, your counter
is not consistent.
I am pretty sure the error is on your side, I do something similar but have
never experienced anything like that. :)
2014-09-19 3:21 GMT+02:00 XingFENG :
> Thanks for your advice. I added tags for message
Thanks for your advice. I added tags for messages in ascending order. But
it didn't work, either.
For example, after 103043 times of communication, in the sender side, it
sends an int 78 with tag 206086, followed by 78 bytes data with tag 206087.
In the receiver side, it receives an int 41 with ta
There is no guarantee that the messages will be received in the same
order that they were sent.
Use tags or another mechanism to match the messages on send and recv ends.
On 09/18/2014 10:42 AM, XingFENG wrote:
I have found some thing strange.
Basically, in my codes, processes send and receive
If all your send/recv are asynchronous you should ensure different tags to
decipher between messages. It could be that you have the same tag for two
different asynchronous sends, in which case there is a race condition for
the receiving end.
Also, if you know the upper bound of your messages I wou
I have found some thing strange.
Basically, in my codes, processes send and receive messages to/from others
with variable lengths asynchronously. When sending messages, a process
would first send the length of message and then the content of the message.
When receiving, a process would first recei
Thank you for your reply! I am still working on my codes. I would update
the post when I fix bugs.
On Thu, Sep 18, 2014 at 9:48 PM, Nick Papior Andersen
wrote:
> I just checked, if the tests return "Received" for all messages it will
> not go into memory burst.
> Hence doing MPI_Test will be eno
I just checked, if the tests return "Received" for all messages it will not
go into memory burst.
Hence doing MPI_Test will be enough. :)
Hence, if at any time the mpi-layer is notified about the success of a
send/recv it will clean up. This makes sense :)
See the updated code.
2014-09-18 13:39
ok i have to wait until tomorrow, they have some problems with the
network...
On 09/18/2014 01:27 PM, Nick Papior Andersen wrote:
I am not sure whether test will cover this... You should check it...
I here attach my example script which shows two working cases, and one
not workning (you ca
I am not sure whether test will cover this... You should check it...
I here attach my example script which shows two working cases, and one not
workning (you can check the memory usage simultaneously and see that the
first two works, the last one goes ballistic in memory).
Just check it with tes
Thanks very much for your reply!
To Sir Jeff Squyres:
I think it fails due to truncation errors. I am now logging information of
each send and receive to find out the reason.
To Sir Nick Papior Andersen:
Oh, wait (mpi_wait) is never called in my codes.
What I do is to call MPI_Irecv once. T
In complement to Jeff, I would add that using asynchronous messages
REQUIRES that you wait (mpi_wait) for all messages at some point. Even
though this might not seem obvious it is due to memory allocation "behind
the scenes" which are only de-allocated upon completion through a wait
statement.
20
On Sep 18, 2014, at 2:43 AM, XingFENG wrote:
> a. How to get more information about errors? I got errors like below. This
> says that program exited abnormally in function MPI_Test(). But is there a
> way to know more about the error?
>
> *** An error occurred in MPI_Test
> *** on communicato
By the way, I am using Open MPI 1.6.5 and programming with C++.
On Thu, Sep 18, 2014 at 4:43 PM, XingFENG wrote:
> Dear all,
>
> I am new to MPI. Please forgive me if I ask a redundant question.
>
> I am now programming about graph processing using MPI. I get two problems
> as described below.
>
14 matches
Mail list logo
