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.
Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4
- The project should include a web server, and an example webpage - Webserver should continue to accept multiple requests from client browser - Webserver should print out logs: how
Shortest path The dijkstra algorithms four steps to discover what it called the shortest path tree . a.The algorithm beings to build the tree identifying its root.
The transport Layer Communication between computers is handled by the transport layer which is comprised of transmission control protocol (TCP) and the users datagram pro
Question : (a) Explain the ‘RAD' methodology with a suitable diagram. (b) One of the activities to be performed during Rapid Application Development is Rapid Business Analys
Q. Explain about Nonboundary-Level Masking? Nonboundary-Level Masking Bytes in the IP address that correspond to 255 in the mask will be repeated in the subnet addres
Question 1 Describe any five different types of computers Question 2 Explain Bus Type LAN. Its advantages and disadvantages and examples Question 3 Explain the s
What is Round Trip Time? The duration of time it takes to send a message from one end of a network to the other and back, is known as RTT.
Q. What is Manchester? - Utilizes an inversion at the middle of each bit interval for both synchronization and bit representation - Negative-to-positive represents binary 1
What is piggybacked ACK The protocol will be incorrect. Suppose that 3-bit sequence numbers we are using. Consider following situation: A just send frame 7. B gets frame
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