Timing in mpi program, Computer Networking

Assignment Help:

MPI_Wtime ( ) returns elapsed wall-clock time in seconds as some arbitrary point in past. Elapsed time for program segment is specified by the difference between MPI_Wtime values at starting and end of process. Process clocks are not essentially synchronised, so clock values are not essentially comparable across the processes, and care must be taken in determining overall running time for parallel program. Even if clocks are explicitly synchronised, variation across clocks still can't be predictable to be significantly less than round-trip time for zero-length message among the processes.

Now, we shall explain use of these functions with an example.

Example 1:

#include

int main(int argc, char **argv) {

int i, tmp, sum, s, r, N, x[100];

MPI_Init(&argc, &argv);

MPI_Comm_size(MPI_COMM_WORLD, &s);

MPI_Comm_rank(MPI_COMM_WORLD, &r);

If(r==0)

{

printf( "Enter N:");

scanf ("%d", &N);

for (i=1; i

MPI_Send(&N, 1, MPI_INT,i, i, MPI_COMM_WORLD);

for (i=r, i

sum+= x[i];

for (i=r, i

{

PRAM Algorithms

 MPI_Recv(&tmp, 1, MPI_INT,i, i,  MPI_COMM_WORLD, &status); Sum+=tmp;

}

printf( "%d", sum);

}

else {

MPI_Recv(&N, 1, MPI_INT,0, i, MPI_COMM_WORLD, &status);

for (i=r, i

sum+= x[i];

MPI_Send(&sum, 1, MPI_INT, 0, i, MPI_COMM_WORLD);

}

MPI_Finalize( );

}


Related Discussions:- Timing in mpi program

Describe the tcp/ip reference model, Computer Networks 1. Differentiate...

Computer Networks 1. Differentiate WAN and LAN. 2. Describe the TCP/IP Reference Model with diagram. 3. Explain Circuit switching and message switching. 4. List the fu

Packet cost - network layer and routing , Packet  Cost Both  distance ...

Packet  Cost Both  distance vector and link  state  routing  are lowest  algorithms. Tow factors  govern  how  cost is applied to packets  in determines  a route. Cost  is a

Describe transport and tunnel mode in detail, Can you describe transport an...

Can you describe transport and tunnel mode in detail with datagram packets?

Objectives of param algorithem, After going through this part, you should b...

After going through this part, you should be capable to: Describe the concepts of message passing programming; List out the various communication modes for communication

Describe at one disadvantage of a peer to peer network, Describe at one dis...

Describe at one disadvantage of a peer to peer network. When you are accessing the resources that are shared by one of the workstations on the network, that workstation takes

What is the routing algorithm used by rip and igrp, Distance vector-based r...

Distance vector-based routing algorithms (also called as Bellman-Ford algorithms) pass periodic copies of a routing table from router to router. Regular updates among routers commu

Networking, can we correct errors using crc?

can we correct errors using crc?

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd