Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
// 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.
Q. Physical Layer Responsibilities of osi model? - Physical characteristics of interfaces as well as media - Representation of bits with no interpretation - Data rate is
State the methods to keep the attackers at bay Another best methods to keep the attackers at bay is known as network address translator or NAT. The philosophy behind the design
UDP is connectionless, and does not give error checking. But remember, error checking can happen at other layers too.
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"
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
Determine the disadvantages of SOCKS protocol The main problem with SOCKS is that it lacks transparency to software developers and users. Implementation requires a change to
explain Learning Bridges in deatil.
Q. What is Source Routing? Source Routing - Sender of packet defines bridges and routes that packet should take - Complete path of bridge IDs and destination address i
A carrier is frequency modulated with a sinusoidal signal of 2 kHz, resulting in a maximum frequency deviation of 5 kHz. (a) Find the bandwidth of the modulated signal (b) The ampl
Q. Explain Stop--and--Wait automatic repeat request? 1. Numbering frames prevents the retaining off duplicate frames. 2. Numbered acknowledgement are needed in case of delay
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd