Example programmes for parallel systems-adding element, Computer Networking

Example Programmes for Parallel Systems

Now we shall complete this with the examples on shared memory programming.

Example 13: Adding elements of an array using two processor int sum, A[ n] ; //shared variables

void main ( ){

int i ;

for (i=0; i

// now create process to be implemented by processor P1

fork(1) add (A,n/2,n-1, sum); // process to add elements from index n/2 to -

1.sum is output variable         // now create process to be implemented by processor

 P0                                                                                           add (A,0,n/2-1, sum);

join 1 ;

printf ("%d", sum);

}

add (int A[ ], int lower, int upper, int sum) {

int sum1=0, i;

 for (i=lower; i<=upper; i++)

sum1=sum1+A[i];

lock sum;

sum=sum+sum1;

unlock sum ;

}

In this program, the last half of the array is passed to processor P1 which adds them. Meanwhile processor P0 adds the first half of the array. The variable sum is locked to avoid inconsistency.

Posted Date: 3/4/2013 5:19:31 AM | Location : United States







Related Discussions:- Example programmes for parallel systems-adding element, Assignment Help, Ask Question on Example programmes for parallel systems-adding element, Get Answer, Expert's Help, Example programmes for parallel systems-adding element Discussions

Write discussion on Example programmes for parallel systems-adding element
Your posts are moderated
Related Questions
Can you define the difference among trusted and untrusted networks?

Q. Explain the Public-Key Cryptography? Public-Key Cryptography - Each user has the same encryption algorithm and key - Decryption algorithm also key are kept secret

To model a WAN, we need a graph in which the nodes model switches and the edges model direct join between switches. The modeling saves essence of network, and it ignores attached d

In the VOIP system, let h be the total number of header bytes added to each chunk, including UDP and IP header. a)  Assuming an IP datagram is emitted every 20 msec, find the tr

Two neighbouring nodes (A and B) use a Go-Back-N protocol with a 3-bit sequence number and a window size of 4. Acknowledgments are cumulative. Assuming A is transmitting and B is r

Explain the Acknowledged connectionless service This is a cross between the previous two services. It provides that datagrams are to be acknowledged, but no prior logical conne

a) Manages protocol access to the physical network medium b) Permits multiple devices to uniquely signify one another on the data link layer

A generic algorithm is mostly analyzed on the basis of the following parameters: the time complexity (implementation time) and the space complexity (amount of space necessary). Usu

PVM uses two environment variables when starting and running. Every PVM user needs to set these two variables to use PVM. The initial variable is PVM_ROOT, which is set to the loca