Example programmes for parallel systems-adding element, Computer Networking

Assignment Help:

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.


Related Discussions:- Example programmes for parallel systems-adding element

In formation sharing at regular intervals, In formation  sharing at  regu...

In formation  sharing at  regular intervals For example  every 30 seconds each router sends its information  about the  whole  network  to its  neighbours. This sharing  occurs

Transport layer in osi model, The Transport layer implements reliable data ...

The Transport layer implements reliable data transport services. The various functions of Transport Layer are listed below The transport layer is meant for transmitting the data

Distributed route computation, In distributed routing computation, every pa...

In distributed routing computation, every packet switch calculates its routing table locally and transmit messages to the neighbors. It also updates information regularly. If a pac

Describe about domain name space, Q. Describe about Domain Name Space ? ...

Q. Describe about Domain Name Space ? - Structure for systematize the name space in which names are defined in an inverted-tree structure with the root at the top - Every l

Briefly explain the terms ''cohesion'' and ''coupling'', QUESTION 1 (a)...

QUESTION 1 (a) Draw a use-case model for the above system. You must identify all possible actors and use-cases. (b) Assume you are using the Rational Unified Process a

Addresses and connection identifiers, Address is a full unique identifier. ...

Address is a full unique identifier. Connectionless delivery needs address on every packet. Connection-oriented delivery may use a short hand that shows the connection rather th

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

Sorting using combinational circuit, Now, let us suppose a famous sequence ...

Now, let us suppose a famous sequence called as bitonic sequence and sort out the elements using a combinational circuit consisting of a set of comparators. The property of bitonic

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