Programming based on message passing, Computer Networking

Assignment Help:

Programming Based on Message Passing

As we know, the programming model based on message passing uses high level programming languages like C/C++ along with a number of message passing libraries like PVM and MPI. Here, given an example program of message passing.

Example 1: Addition of array elements using two processors.

In this problem, we have to search the sum of all the elements of an array A of size n. We shall separate n elements into two groups of roughly equal size. The first [n/2] elements are added by the first processor, P0, and last [n/2] elements the by second processor, P1. The two sums then are added to get the final result. The program is given below:

Program for P0

#include

#define n 100

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

int A[n];

int sum0 =0, sum1=0,sum; MPI_Init(&argc, &argv);

for( int i=0;i

scanf("%d", &A[i]);

MPI_Send( &n/2, n/2, MPI_INT,1, 0, MPI_COMM_WORLD);

for(i=1; i

sum0+=A[i];

sum1=MPI_Recv(&n/2, n/2, MPI_INT,1, 0, MPI_COMM_WORLD);

sum=sum0+sum1; printf("%d",sum); MPI_Finalize();

}

Program for P1,

int func( int B[int n])

{

MPI_Recv(&n/2, n/2, MPI_INT,0, 0, MPI_COMM_WORLD);

int sum1=0 ;

for (i=0; i

sum1+=B[i];

MPI_Send( 0, n/2, MPI_INT,0, 0, MPI_COMM_WORLD);

}


Related Discussions:- Programming based on message passing

Network performance & characteristics, There are two kinds of characteristi...

There are two kinds of characteristics in case of network performance. Delay Throughput

Explain about domain name system, Q. Explain about Domain Name System? ...

Q. Explain about Domain Name System? -In the past, mapping of IP addresses was static using a host file -Impossible in today's dynamic environment -Domain Name System (DN

Cloud computing, Ask questiXYZ, is Pakistani company which is selling toys ...

Ask questiXYZ, is Pakistani company which is selling toys in all the major cities of Pakistan having 50 outlets in different cities. The company has the revenue of 10000000/- PKR p

Link-state routing, In link-state routing network topology is filled from...

In link-state routing network topology is filled from route calculation. Switches send link-state information about local joins. Every switch creates own routing tables. It needs

The cut-through switching technique work, How does the cut-through switchin...

How does the cut-through switching technique work? Ans) Cut-Through switching copies only the destination address which is the first 6 bytes after the =frame preamble into its b

Asynchronous or statistical time division multiplexing, Asynchronous or Sta...

Asynchronous or Statistical Time Division Multiplexing As we  have seen  synchronous  TDM does not  guarantee that the full capacity of a link in sued. In fact it is more like

State the disadvantages of ring topology, Point out the disadvantages of Ri...

Point out the disadvantages of Ring Topology. The drawbacks of ring topologies are: a. It is considerably complex to install and reconfigure ring topology b. Media failur

Explain priority and reservation of token passing, Priority and Reservation...

Priority and Reservation Higher priority stations may possibly access the token sooner Each station has a priority code Since token passes by station waiting to t

Maximum hop count for link-state protocols, Normal 0 false fa...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Shortest path - network layer and routing , Shortest path  The  dijkst...

Shortest path  The  dijkstra algorithms  four steps to discover what it called  the shortest path  tree . a.The algorithm  beings  to build  the tree identifying  its root.

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