Sir,
I am student doing project on MPI(implementing parallel matrix multiplication algorithms on several computers).i installed the MPI software in the server of my college. But there exists some problem in the server(during lamboot).
Actually I have do master slave programming i.e one computer as master and remaining computer as slaves and execute my programs.As there is problem in the server I started implementing the same algorithm in a single machine with rank 0 as master and remaining processes(rank 1,2….) as slaves and calculated the computation time.
My doubt is that am I doing the correct way (executing on single machine with several processes as I mentioned above) and another reason is that I am not having sufficient time to do another way.
Is there any any difference in calculating the computation time in both the ways
Briefly to say
Is there any difference in executing the parallel algorithm (using MPI) on single machine with several processes(rank 0 as master and remaining as slaves) instead of executing on a parallel computer with several computers(nodes)(i.e node 0 as master and node 1,2 ….as slaves).
I am following the first approach (single machine) and doing the code for fox and cannons algorithm. Is that the correct method.
---------------------------------
Here’s a new way to find what you're looking for - Yahoo! Answers
|
