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

Distributed shared memory systems, Distributed Shared Memory (DSM) systems ...

Distributed Shared Memory (DSM) systems copy a shared memory abstraction on loosely coupled architectures in order to allow shared memory programming despite missing hardware suppo

Describe about packet switching, Q. Describe about Packet Switching? P...

Q. Describe about Packet Switching? Packet Switching - Data are transmitted in separate units - Called Packet - Packets are variable length blocks - The max leng

Unshielded twisted pair - transmission media, Q. Unshielded Twisted Pair - ...

Q. Unshielded Twisted Pair - transmission media? - A most common kind suitable for both voice and data transmission - Categories are determined by chain quality - Cat 3 c

Example of go back - N protocol, Q. Example of go back - N protocol? Th...

Q. Example of go back - N protocol? The window size is 4. A sender has sent frame 6 as well as the timer expires for frame 3 (frame 3 not ACKn'd). The sender goes back as we

Difference between windows 2000 and windows 2003, What is the difference am...

What is the difference among Windows 2000 and Windows 2003?

Enumerate about the home page and hot links, Enumerate about the Home Page ...

Enumerate about the Home Page and Hot Links Home Page: The primary Web page for an individual or organisation. These pages link to other related pages. Hot Links: A co

Computing shortest path in a graph, While calculating shortest path, first ...

While calculating shortest path, first we assume graph presentation of network at every node then we use Djikstra's algorithm to calculate shortest path from every node to other on

Characterization of networks, CHARACTERIZATION OF NETWORKS:  There are...

CHARACTERIZATION OF NETWORKS:  There are three kinds of characterization of networks. LOCAL AREA NETWORK (LAN):  It is needed for a single building. METROPOLOTAN AREA

Go back-n ( gbn) - transport layer, Go Back ( GBN) Go back  N ARQ is s...

Go Back ( GBN) Go back  N ARQ is specific  instance of the  automatic  repeat request protocols  in which  the sending  process continues to send  a number of frames specific

Which statement best defines access list placement, When using access lists...

When using access lists, it is important where those access lists are placed. Which Statement best defines access list placement Ans) Put standard access lists as near the desti

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