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

Determine the uses of firewalls, Determine the uses of firewalls The fi...

Determine the uses of firewalls The firewalls available today do all the things, viz., like filter the data packets, provide proxy services and do stateful inspection of packet

Deadlock avoidance or prevention, Deadlock Avoidance To avoid deadlock...

Deadlock Avoidance To avoid deadlocks two types of strategies are used: 1) Static prevention: It uses V and P operators and Semaphores to allocate and deallocate shared res

Digital encoding, A modified NRZ code known as enhanced-NRZ (E-NRZ) operate...

A modified NRZ code known as enhanced-NRZ (E-NRZ) operates on 7-bit words; inverting bits 2,3,6 and 7; and adding one parity bit to each word. The parity bit is chosen to make the

Evolution of data communication, Question 1 Discuss the following         ...

Question 1 Discuss the following                     Evolution of Data Communication                     Elements of Data Communication System Question 2 Explain the following

Timesharing system, advantages and disadvantages of time sharing system

advantages and disadvantages of time sharing system

Perfect shuffle permutation-concept of permutation network, Perfect Shuffle...

Perfect Shuffle Permutation This was advised by Harold Stone (1971). Consider N objects each characterized by n bit number say  X n-1, X n-2, X 0    (N is chosen such that N

Define the term - proxy servers, Define the term - Proxy servers These ...

Define the term - Proxy servers These types of firewalls have been further classified into two types: application level gateways and circuit level gateways. The application

Explain about flow control, Q. Explain about Flow Control? - Signifies...

Q. Explain about Flow Control? - Signifies to ask the transmitter to stop/resume sending in data - Required when DTE to DCE speed > DCE to DCE speed - (Exampl

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