Shared memory programming, Computer Networking

We know that all processors share a common memory in shared memory model. Every processor, however, can be assigned a different part of the program stored in the memory to implement with the data stored in specified locations. Every processor does computation independently with the data allocated to them by the controlling program, called the main program. After completion their computations, all of these processors join the main program. The main program complete only after all child processes have been terminated completely. There are many alternatives to execute these ideas through high level programming.  Some of them are:

i)   Using heavy weight processes.

ii)  Using threads.( e.g. Pthreads).

iii) Using a completely new programming language for parallel programming (e.g. Ada)

iv) Using library routines with an existing sequential programming language.

v)  Modifying the syntax of an existing sequential programming language to produce a parallel programming language (e.g. UPC).

vi) Using an existing sequential programming language improves with the compiler directives for specifying parallelism (e.g.  OpenMP).

We shall adopt the final alternative. We shall also give an introduction to the shared programming using library routines with an existing sequential programming language.

Posted Date: 3/4/2013 5:08:40 AM | Location : United States







Related Discussions:- Shared memory programming, Assignment Help, Ask Question on Shared memory programming, Get Answer, Expert's Help, Shared memory programming Discussions

Write discussion on Shared memory programming
Your posts are moderated
Related Questions
Verify Passwords Step 1 : Telnet to the router from Host2 and verify the Telnet password. You should be able to telnet to either Fast Ethernet interface of the router. I

Explain the basic of Network Properties   The subsequent properties are related with interconnection networks. 1)  Topology: It refers how the nodes a network are systema

User Datagram Protocol - UDP is a connectionless oriented transport protocol for use when the upper layers give error-recovery and reliability. UDP does not series data or re-assem

Consider the following network example. With the indicated link costs along each link in the figure, use Dijkstra's shortest-path algorithm to compute the shortest path from x to a

In case of any new event switch do broadcast, after that always do Unicast.

Q. What are the main categories based on which applications of computer network will be categorized? Ans: The main areas under which the applications for computer network will

Question: (a) Show by means of a diagram the Ethernet frame structure and describe the six fields of the Ethernet frame structure. (b) Explain the operation of the Carrier S

The Common method for writing a program with PVM is as follows: A user writes one or more sequential programs in C, C++, or Fortran 77 having embedded PVM function (or subroutin


Q. Calculate Utilization percentage of the link? - System: Stop and wait ARQ - Bandwidth: 1Mbps - Round trip for one bit: 20ms - Frame length: 1000 bits Utilizatio