Dear all,
I would like to have a confirmation on the assumptions I have on how
OpenMPI implements the rendezvous protocol for shared memory.
If process A sends a message to process B and the eager protocol is used
then I assume that the message is written into a shared memory area and
picked
Dear all,
We are starting studying replication for MPI applications. A few papers
have been published in the last months on this topic.
We were wondering if anybody has already started working on providing
process replication in Open MPI ? And if yes, is there some code
available ?
Best re
Thank you for teaching me google :). By the way I gave the same query before.
But this time I made deep search and found 5 to 6 mpi implementations of
sorting;) Thanks for your help. But you didn't reply my last question.
From: Jeff Squyres
To: Mudassar Maje
On May 22, 2012, at 2:35 AM, Mudassar Majeed wrote:
>The algorithms can be like implementation of sorting
> algorithms using OpenMPI. Secondly, can you name one such MPI-middleware that
> performs the tuning on runtime for selection of best algorithms (based on the
> parameters)
Dear Jeff,
The algorithms can be like implementation of sorting algorithms
using OpenMPI. Secondly, can you name one such MPI-middleware that performs the
tuning on runtime for selection of best algorithms (based on the parameters)
and composition of parallel applications ?? You
