Skip to main content

Critical Section Problem In Operating System


      ⇰  CRITICAL SECTION :-

Critical Section is the part of a program where shared resources or data are accessed by various cooperative processes. That resource may be any resource in a computer like a memory location, Data structure, CPU or any IO device.
     Therefore we can say when more than one processes access a same code segment that segment is known as critical section. The resources or data which are present in critical section must be synchronized to maintain data consistency. 

Each process has a segment of code called critical section, where the process may be changing common variables, updationg a table, writing a file and so on. The important feature of system is that when one process is executing in critical section, no other process is allowed to execute or enter in critical section.  An atomic action is required in a critical section means, only one process can execute in its critical section at a time. All the other processes have to wait to execute in their critical sections until it become empty.

The critical section cannot be executed by more than one process at the same time. But operating system faces some difficulties in allowing and disallowing the processes from entering the critical section again and again. The critical section problem is used to design a set of protocols which must ensure that the race condition will never occur. Each process must request permission to enter the critical section. The section of code for this request is called Entry section. The remaining code is called the remainder section.
In order to synchronize the cooperative processes in any system, the main task is to solve the critical section problem. A solution  to the critical section problem must satisfy the following requirements :-

  i> Mutual Exclusion :- If one process is in critical section, then no other process can be allowed to enter in critical section. This will done by writing the code of entry section.

 ii> Progress :- If no process is executing in critical section and some process wish to enter the critical section, then only those can enter that are not executing in their remainder section.

iii> Bounded Wait :- Their exist a bounded limit on the number of times that one process is allowed to enter in critical section regularly. Means there is a limit that a process can enter critical section.

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


Labels

Labels:

Comments

Post a Comment

Please comment.

Popular posts from this blog

Process & Its state And process control block :-

                ⇰  PROCESS :- A process can be thought of as a program in execution. Means when any program is executed it becomes process. A processwill need certain resources such as CPU time , memory, files and I/O devices to complete its task. These resources are allocated to the process either when it is created or at the time of execution.             A process is the unit of work in most systems. A system consistes of a collection of processes. All these processes may execute concurrently. Traditionally a process contained only a single thread. Most modern operating ststems now supports processes that have multiple threads.         The operating system is responsible for several important works of process management as - the creation and deletion of process, the schrduling of process, communication and deadlock handling of process. Process is broudly divided into two ...
Post a Comment
Read more

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

Definition of Stack and its algorithm with working process(data structure)

                  Stack                           A Stack is  an ordered collection of items where the addition of items and the removal of existing items always takes place at the same end. This end is commonly referred to as the “top". * working method of stack :- i> Initially top=-1 ii> By increasing top pointer we can insert element    in the stack. iii> when top=size of stack-1  then stack is full. iv> By decreasing the top pointer we can remove   the   element from stack. v> when top=-1 then the stack is empty. figure shows run time stack * The fundamental operations which are possible on a stack are:-         1. push operation (insertion).    2. pop operation (deletion).    3. peep opetation(extract informat...
2 comments
Read more