In the recvi function, do you first try to match off the unexpected list before you try and match data in the fifo’s ?
On 1/21/09 8:00 PM, "Eugene Loh" <Eugene.Loh@sun.com> wrote:
Ron Brightwell wrote:
But HPCC RandomAccess also just uses non-blocking receives. So, it's kind of outside the scope of the original ideas here (bypassing the PML receive-request data structure).
If you poll only the queue that correspond to a posted receive, you only optimize micro-benchmarks, until they start using ANY_SOURCE.
Note that the HPCC RandomAccess benchmark only uses MPI_ANY_SOURCE (and
It's possibly not even a poster child for the single-queue idea either. Single queue probably shines best when you have to poll all connections for a few messages. In contrast, RandomAccess (I think) loads all connections up randomly (pseudo-evenly).