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

How to configure a wireless mac filter - ccna, Configure a Wireless MAC Fil...

Configure a Wireless MAC Filter Step: Add a Mac filter. Navigate back to the web utility page of the router (http://172.17.30.1). Navigate to the Wireless section a

Calculate the efficiency of stop-and-wait ARQ, 5. Suppose that frames are 1...

5. Suppose that frames are 1250 bytes long including 25 bytes of overhead. Also assume that ACK frame are 25 bytes long. Calculate the efficiency of Stop-and-Wait ARQ in a system t

Explain about line coding, Q. Explain about line coding? Line Coding ...

Q. Explain about line coding? Line Coding  Procedure of converting binary data to a digital signal DC Components  Residual dc (direct-current) components or

Calculate link utilisation - exchanging packets, a)  Assume that the time r...

a)  Assume that the time required to transmit one packet (i.e. the packet length divided by link data rate) is 10ms and the Round Trip Time (from Source to Destination and back) is

Introduction to operations research, explain the three classification of op...

explain the three classification of operation research

Define the term - handoff and dynamic configuration, Define the term - Hand...

Define the term - Handoff and Dynamic configuration Handoff/roaming  The MAC protocol used in the wireless LAN should enable mobile stations to move from one cell to anoth

Pvm library routines, In this part we shall give a short description of the...

In this part we shall give a short description of the routines in the PVM 3 user library. Each PVM program should include the PVM header file "pvm3.h" (in a C program) or "fpvm3.h"

What is beaconing, What is Beaconing? The process that permits a networ...

What is Beaconing? The process that permits a network to self-repair networks problems. The stations on the network notify the other stations on the ring when they are not rece

What is the routing algorithm used by rip and igrp, Distance vector-based r...

Distance vector-based routing algorithms (also called as Bellman-Ford algorithms) pass periodic copies of a routing table from router to router. Regular updates among routers commu

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