Skip to main content

Process Synchronization & Race Condition

  
    ⇰  SYNCHRONIZATION :-

 Process Synchronization is simply a way to coordinate processes that share something or use shared data. Synchronization occurs in an operating system among cooperating processes. Before starting the brief discuss we have to know types of processes.
  There are two types of process according to sharing :-
i>  Independent process.
ii> Coordinate process.

 i>  Independent process :- Those process which do not share anything to other processes is called Independent process. Execution of one process will not affect other process.

ii> Coordinate process :- Those process which share something with other processes as common variable, memory, code or resources(cpu, printer). So execution of a particular process can affect other process. And cooperative process is not properly synchronised, that can create problem as data inconsistancy.

  While executing many cooperative processes, process synchronization helps to maintain shared data consistency and cooperating process execution. Processes have to be synchronized to ensure that concurrent access to shared data or anything does not create inconsistency. Let us see a problem:-
 Consider two peocesses P1 and P2 running on some system at same time. Let there is a common variable 'shared'.
sleep(1) :- This code is used to switch Between processes.

Execution of Processes will bs as follows:- 
Hence shared=4, which is wrong because in execution of P1 & P2, X++ and Y-- emplies the same as 5++ =>6 and 6-- => 5. 
This situation arrised because P1 & P2 are not synchronized.
      ⇰  RACE CONDITION :-

 When data is not consistent the situation is called race condition. A race condition occurs when two or more porcesses execute at the same time, without synchronized in the proper sequence. As we can see in our above example when we start execution of P1 first than P2, we get shared=4 and id we start P2 first than P1 we get shared-6. But both are wrong because shared must equal to 5.

    The situation like this, where several processes access and manipulate the same data concurrently and outcome of the execution depends upon particular order in which access takes place is called as race condition. 

 click here for critical section

 Share, Follow and please comment if you find anything incorrect or to share more information about the topic discussed above


Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process Scheduling And Types of Process Schedular :-

        ⇰ PROCESS SCHEDULING Process Scheduling  is a task  of Operating System that schedules processes of different states like new, ready, waiting, terminated  and running.This scheduling helps in allocation of CPU time for each process, and Operating System allocates the CPU time for each procss. And the process scheduling plays important role to keep the CPU busy all the time.  ⏩   Followings are some objectives of Process Scheduling :-  i > To increase the amount of users within acceptable response times.  ii > To maintain the balance between response and utilization of system. iii > To decrease the enforce priorities and  give reference to the processes holding the key resources.      ⇰  PROCESS SCHEDULAR A scheduler carries out the pro cess scheduling work. Schedulers are often implemented so they keep all computer resources busy and  allows multiple users to shar...
8 comments
Read more

Semaphores In Process Synchronization

   ⇰  Semaphores :-   Semaphore is actually a method or tool to prevent race condition. Race condition can cause loss of data or even deadlock situation. For prevention from these conditions, the semaphore is one of the method.  Semaphore was proposed by Dijkstra in 1965. Simaphore    is a very significant technique to manage concurrent processes.  Semaphore is useful tool in the prevention of race condition. But the use of semaphore never means a guarantee that a program is free from these problems.     Semaphore is an integer variable which is used in mutual exclusive manner by various concurrent cooperative processes in order to acheive synchronization. Hence semaphore is one of the way to achieve synchronization.  Semaphore is basically  a variable which is non-negative and shared between threads. This variable is used to solve the critical section problem and to achieve process synchronization in the multiprocess...
Post a Comment
Read more

DeadLock In Operating System

      ⇰  DEADLOCK :- As we know in a multiprogramming environment several processes may compete for a finite number of resources. If a process requests resources and if the resources are not available at that time, the process enters a state called  waiting state. Sometimes, a waiting process is never again able to change state or never out from waiting state, because the resources it has requested are held by or taken by other waiting processes before this process.This situation is called a Deadlock.     ⇰  DEADLOCK CHARACTERIZATION:- In a deadlock processes never finish executing and system resources are tied up  and also  preventing other jobs from starting. Here are some features that characterize deadlocks. A deadlock situation can arrive if the following four conditions hold simultaneously in any operating system :- 1. Mutual exclusion :- A process must hold at least one resource in a nonsharable mode so tha...
3 comments
Read more