Shared programming using library routines, Computer Networking

Shared Programming Using Library Routines

The most well-liked of them is the use of combo function called fork() and join(). Fork() function is used to make a new child process. By calling join() function parent process waits the terminations of the child process to obtain the desired result.

Example 11: Consider the following set of statements

Process A                                 Process B

:                                                      :

fork B ;                                                      :

:                                                                :

join B;                                                      end B;

In the above set of statements process A makes a child process B by the statement fork B. Then A and B continue their computations independently up to  A reaches the join statement, At this stage, if B is already ended, then A continues implementing the next statement otherwise it waits for B to finish.

 In the shared memory model, a common trouble is to synchronize the processes. It may be possible that more than one process is trying to concurrently modify the similar variable. To solve this problem many synchronization mechanism like test_and_set, monitors and semaphores have been used. We shall not go into the details of these mechanisms. Quite, we shall represent them by a pair of two processes called lock and unlock. Whenever a process P locks a common variable, then only P can use that variable. Other simultaneous processes have to wait for the common variable until P calls the unlock on that variable. Let us see the effect of locking on the output of a program when we do not use lock and when we use lock.

Example 12

Let us write a pseudocode to find sum of the two functions f(A) + f(B). In the first algorithm we shall not use locking.

Process A                               Process B

sum = 0                                           :

:                                                  :

fork B                                    sum = sum+ f(B)

:                                                   :

sum = sum + f(A)                         end B


join B


end A

If process A implements the statement sum = sum + f (A) and writes the results into main memory followed by the computation of sum by process B, then we get the right result. But consider the case when B implements the statement sum = sum + f (B) before process A could write result into the main memory. Then the sum contains only f(B) which is not right. To avoid such inconsistencies, we use locking.

Process A                               Process B

sum = 0                                           :

:                                                  :

:                                                  lock sum

fork B                                    sum = sum + f(B)

:                                                   unlock sum

 lock sum                                        :

sum = sum + f(A)                         end B

unlock sum


join B


end A

In this case whenever a process gets the sum variable, it locks it so that no other process can access that variable which makes sure the consistency in results.

Posted Date: 3/4/2013 5:16:53 AM | Location : United States

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

Write discussion on Shared programming using library routines
Your posts are moderated
Related Questions
List the steps included in creating the checksum. a. Separate the data into sections b. Add the sections together using 1's complement arithmetic c. Take the complement o

Error detection and correction The digital traffic stream of second generation systems also lends itself to the use of error detection and correction methods. The result can be

Work-Sharing Constructs A work-sharing construct distributes the implementation of the associated region between the members of the team that encounters it. A work-sharing cons

Fiber Optic Cable A fiber  optic  cable is made  of glass or plastic and transmits signals in the form of light pulses. An optical fiber  is a thin  flexible medium  conducts

Overview Create a prototype web site for the "Computer Superstores" company. Your site should use effective navigation features and demonstrate good structure for  accessibility

As we previously know, the merge sort algorithm needs two circuits, i.e. one for merging and second for sorting the sequences. Thus, the sorting circuit has been derived from the a

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

10Base5 - Thicknet A rigid coaxial cable (RG-8) approx 0.4 in' thick used in the original Ethernet networks Bus topology LAN utilize base signalling with a maximum se