synchronization principles of parallel programming , Computer Networking

In multiprocessing, various processors have to to communicate with each other. Therefore, synchronisation is needed between them. The correctness and performance of parallel execution depends upon efficient synchronisation between concurrent computations in multiple processes. The synchronisation problem may occur because of sharing of writable data objects between processes. Synchronisation includes executing the order of operations in an algorithm by finding the dependencies in writable data. Shared object access in an MIMD architecture needs dynamic management at run time, which is much more difficult as compared to that of SIMD architecture. Low-level synchronization primitives are executed directly in hardware. Other resources like Bus, CPU and memory unit also need synchronisation in Parallel computers.

To study the synchronization, the following dependencies are identified:

i)  Data Dependency:  These are RAW,WAR and WAW dependency.

ii) Control dependency: These depend upon control statements like IF THEN, GO TO, etc.

iii)Side Effect Dependencies:  These arise due to Traps, exceptions, I/O accesses. For the proper implementation order as enforced by correct synchronization, program dependencies must be analyzed properly. Protocols like wait protocol and sole access protocol are used for doing synchronization.

 

Posted Date: 3/4/2013 5:30:42 AM | Location : United States







Related Discussions:- synchronization principles of parallel programming , Assignment Help, Ask Question on synchronization principles of parallel programming , Get Answer, Expert's Help, synchronization principles of parallel programming Discussions

Write discussion on synchronization principles of parallel programming
Your posts are moderated
Related Questions
Question 1: (a) How are IPv4 addresses transformed into IPv6 addresses using IPv4 compatible addresses? (b) Name some of the simplifications that were introduced in IPv6.

Vector-Distance algorithm illustrated in more detail below: Packet switches wait for next update message and they goes by entries in packet. If entry has least path to destinat

Question 1 Define client and server. Explain the Client server model Question 2 What is a Mainframe System? Write down the features of Mainframe System Question 3

Other than performance  issues, there could be security reasons for using something like xinetd.  Make simple design in which a new version of xinetd gives a layer of security.

Question 1 Discuss the benefits and requirements of VOIP Question 2 Define the following Multicast routing protocol explain in detail with diagram Multicast backbone


what is software

Mean node-node path The mean node-node path is two times the mean node-root path.  Number the levels of the tree with the root as 1 and the deepest level as N.  The path from t

You should develop a system consisting of an application acting as a broker and several agents that need to communicate between them. The agents can only communicate in pairs (i.e.

The Data link layer performs the following: Responsible for physically passing data from single node to another. Translates messages from the upper layers into data frames and adds