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

Netware protocol provides link-state routing, Which NetWare protocol provid...

Which NetWare protocol provides link-state routing? Ans) NetWare Link Services Protocol (NLSP) gives link-state routing. SAP (Service Advertisement Protocol) advertises network

System analysis, explain the appropriateness of economic and behavioral fea...

explain the appropriateness of economic and behavioral feasibility

Independent loops statement, INDEPENDENT Loops HPF gives additional opp...

INDEPENDENT Loops HPF gives additional opportunities for parallel implementation by using the INDEPENDENT directive to assert that the iterations of a do-loop can be done indep

Data mining, The following DNA sequences are extracted from promoter region...

The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the giv

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

Physical media - computer network, Physical Media In order  to define ...

Physical Media In order  to define what is meant by a physical medium let us reflect on the brief life of a bit. Consider  a bit travelling from one end system through a serie

What do you mean by substitutional ciphers, Q. What do you mean by Substitu...

Q. What do you mean by Substitutional Ciphers? Substitutional Ciphers Monoalphabetic Substitution Polyalphabetic Substitution - Transpositional - character

What is meant by asymmetrical protocols, What is meant by Asymmetrical prot...

What is meant by Asymmetrical protocols? There is a many-to-one relationship among clients and server. Clients always initiate the dialog by requesting a service. Servers are p

Tools that an attacker can use to crack wep, Question: Consider that yo...

Question: Consider that you have to configure a small WLAN of 8 computers using Wired Equivalent Privacy (WEP) and that you have to best make use of its available security f

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