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

Matrix computation and multiplication, In the following section, we shall d...

In the following section, we shall discuss the algorithms for solving the matrix multiplication difficulty using the parallel models. Matrix Multiplication Problem Let ther

Will the client send a tcp or udp packet, Question: (a) Explain the usa...

Question: (a) Explain the usage of the following parts of the IPv4 datagram format. i. VERS ii. HLEN iii. TOTAL LENGTH iv. SERVICE TYPE v. HEADER CHECKSUM (b) Na

Building distributed systems, Unfortunately, building real-life distributed...

Unfortunately, building real-life distributed systems is not easy. It is hard, for instance, to implement instructions such as "send this data structure to be processed on that com

Analysis of sort_bitonic, The bitonic sorting network needed log n number o...

The bitonic sorting network needed log n number of stages for performing the task of sorting the list. The first n-1 stages of the circuit are able to sort two n/2 numbers and the

Determine about unique least-cost path, Determine about unique least-cost p...

Determine about unique least-cost path If there is a unique least-cost path, the two algorithms will yield the similar result because they are both guaranteed to search the lea

Program annotation packages, A fairly renowned approach in this area is Ope...

A fairly renowned approach in this area is OpenMP, a recently developed industry standard for shared memory programming on architectures with uniform memory access characteristics.

Unused reserved - trannsport layer, Unused Reserved This  is a 6 bi...

Unused Reserved This  is a 6 bite field  reserved for future use.

What is a dns resource record, What is a DNS resource record? A resourc...

What is a DNS resource record? A resource record is an entry in a name server's database. There are various types of resource records used, containing name-to-address resolutio

What are the advantages of bus topology, What are the advantages of bus top...

What are the advantages of bus topology? The benefit of physical bus topology is: a. It uses established standards and it is relatively simple to install. b. It needs les

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