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
- The model was developed by the ISO (International Organisation for Standardisation) in 1984. It is currently considered the primary Architectural model for inter-computer communi

Describe about the Network equipment and connectivity Network equipment and connectivity should address various networking equipments such as routers, types of cables, as well

What is the different type of networking / internetworking devices? 1. Repeater: Also known as a regenerator, it is an electronic device that operates only at physical layer.

Illustrate the downside of groupware The downside of groupware is that they are very costly and with the increase in complexity or additional features, the cost increases propo

PRAM is one of the models used for designing the parallel algorithm as given in Figure. The PRAM models have the following components: A set of identical type of processors

NetWare IPX addressing uses a network number and a node number. Which  statements are true? A. The network address is administratively assigned and can be up to 16 hexadecimal digi

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

Q. What do you mean by Substitutional Ciphers? Substitutional Ciphers Monoalphabetic Substitution Polyalphabetic Substitution - Transpositional - character

How to prevent the data from hackers In order to prevent intruders from entering the house, it is necessary for the house owner to look after the behaviour of internal and exte

Application Layer The  application layer is where  network  applications and their  application layer protocols  reside. The internet application layer includes many protocols