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.
Define the concept of one way redistribution and mutual
Q. Show the Refraction and Reflection in Fiber-optic cable ? - Refraction often takes place when light bends as it passes from one medium to another less dense medium - Wh
Simplicity The advantage of this approach is the simplicity of receiver buffering. The receiver need not buffer out of order packets the sender must maintain the upper an
LRC - Performance Detects every burst errors up to length n (number of columns) If two bits in one data unit are damaged as well as two bits in exactly same positions
Question: a) Show the shortest form of the following IPv6 address: 2340:0000:0000:000F:7000:119A:A001:0000 b) The IPv6 header includes a Class field and a Flow ID field. Bri
Types of Redundancy Checks Parity Check Simple Parity Check Two Dimensional Parity Check / Longitudinal Redundancy Check (LRC) CRC (Cyclic Redundancy Check)
explain the three classification of operation research
Different layers of OSI Model ?
Name the Twisted pairs cables Twisted pairs cables (Shielded and Unshielded), Coaxial cable and Fiber optic cable. ?Testing of the points ?Testing of the entire network t
QUESTION a) How is an Intranet different from an Internet? b) State the main differences between a router and a switch c) Explain the function of a modem d) Calculate
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