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.
What are NETBIOS and NETBEUI? NETBIOS is a programming interface that permits I/O requests to be sent to and received from a remote computer and it hides the networking hardwar
Packet Cost Both distance vector and link state routing are lowest algorithms. Tow factors govern how cost is applied to packets in determines a route. Cost is a
Q. Show the Go-back-N - Control Variables? - S- holds the series number of the recently sent frame - SF - holds sequence number of the first frame in the window - SL - ho
What are the basic LAN topologies? The three simple LAN topologies that are combined to shape any practical topology are called as basic LAN topologies. They are, Bus Topology
design issues
What is the method of ICMP packets?
Reference models Designing implementing and manufacturing computer networks and related devices are very complex activities. Therefore in order for this technolog
Explain Persistence timer? To deal with the zero-size windows What if a receiver advertises that the window size is 0 (by sending ACK) and this ACK is lost? - A
What Automatic Repeat Request (ARQ)? Error control is both error detection and error correction. It allows the receiver to inform the sender of any frames lost or damaged in tr
Q. Describe the Class C Addresses? The initial three octets are the network number as well as the last octet is the host number 2096896 blocks used for assignment to o
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