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

What is the effect on the security of the password, Question: (a) What...

Question: (a) What is a script kiddie? Is it a significant security threat, and why? (b) Assume that UNIX uses the user login name in lieu of the traditional salt, what is

Metrics are used by routing protocols, What metrics are used by routing pro...

What metrics are used by routing protocols to verify the best path?

What is the frame, What is the Frame A presentation format, which en...

What is the Frame A presentation format, which enables Web page designers and users to mark a part of the screen for links to other pages. Frames usually appear on the left

What are the working of software team, What are the working of software tea...

What are the working of software team The software team has to learn every bit of things related to computers. Since different users work on different platforms and application

Comparison of distance-vector and link-state algorithm, DISTANCE-VECTOR ROU...

DISTANCE-VECTOR ROUTING: It is easy to implement. Packet switch modifies its own routing table first. It is used in RIP. LINK-STATE ALGORITHM: It is ve

What is meant by asymmetric multiprocessing (amp), It imposes hierarchy and...

It imposes hierarchy and a division of labor between processors. Only one designated processor, the master, controls (in a tightly coupled arrangement) slave processors dedicated t

What are hold-downs used for, Hold-Down Timers - Routers ignore network upd...

Hold-Down Timers - Routers ignore network update information for a number of periods.

When the router runs out of buffer space, Source quench is the process wher...

Source quench is the process where the destination router, or end internetworking device will "quench" the date from the "source", or the source router. This usually occurs when th

How intranets encourage integration of applications, How Intranets encourag...

How Intranets encourage integration of applications Intranets encourage integration of applications; such as the simple word processing application could be easily linked with

Packet switching - fundamentals of networks, Packet Switching In the  ...

Packet Switching In the  packet  switching network  type on specific  path is  used for  data  transfer. Instead the data is chopped up into  small  pieces called packed and s

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