Critical section problem


Critical section problem is a problem when a process access shared resource is called critical section. And we wants system should not fall in inconsistency even after multiple processes.

For example:
In above image,
In  section of codes there are two types of resources, private resources and shared resources.

Accessing private resources: When accessing private resources there is no requirement of any order or schedule, because it's private and used by its private member.

Accessing shared resources: But when accessing shared resources there is the requirements of a order, a fashion, because it's shared process but accessing must be in mutual exclusive fashion.
Only one processes can access that shared resource at a time, so scheduling is must.

Shared resources section is denoted as Critical section.

So what is critical about it ?

We needed a proper mechanism to access shared resources.

So here problem is how to access critical section so there should not be any problem or inconsistency.

The solution of Critical section problem depends/ judge on the basis of these three criterias-

1) Mutual Exclusion - means only one process will access critical section at a time. Mutual exclusion is a mandatory criteria,

2) Progress- Only those processes should compete which actually wants to enter critical section.

For example: Out Of process P1, P2, P3 only P1 and P2 wants to enter in critical section. Than only P1, P2 should be considered in any solution. Progress is a mandatory criteria.
3) Bounded Wait- There must be a maximum bound up to which a process can wait. Means there should be a time limit after which we can guarantee that process will get enter in critical section. Bounded wait is an optional criteria, because its not possible to fulfill this criteria every time.
Only those critical solutions are acceptable which are satisfied by above three criterias.
Operating Systems: covered following topics in Operating Systems.
    A list of Video lectures

    Python Programming ↓ 👆
    Java Programming ↓ 👆
    JAVA covered following topics in these notes.
    JAVA Programs
    Principles of Programming Languages ↓ 👆
    Principles of Programming Languages covered following topics in these notes.

    Previous years solved papers:
    A list of Video lectures References:
    1. Sebesta,”Concept of programming Language”, Pearson Edu 
    2. Louden, “Programming Languages: Principles & Practices” , Cengage Learning 
    3. Tucker, “Programming Languages: Principles and paradigms “, Tata McGraw –Hill. 
    4. E Horowitz, "Programming Languages", 2nd Edition, Addison Wesley

      Computer Organization and Architecture ↓ 👆

      Computer Organization and Architecture covered following topics in these notes.

      1. Structure of desktop computers
      2. Logic gates
      3. Register organization
      4. Bus structure
      5. Addressing modes
      6. Register transfer language
      7. Direct mapping numericals
      8. Register in Assembly Language Programming
      9. Arrays in Assembly Language Programming


      1. William stalling ,“Computer Architecture and Organization” PHI
      2. Morris Mano , “Computer System Organization ”PHI

      Computer Network ↓ 👆
      Computer Network covered following topics in these notes.
      1. Data Link Layer
      2. Framing
      3. Byte count framing method
      4. Flag bytes with byte stuffing framing method
      5. Flag bits with bit stuffing framing method
      6. Physical layer coding violations framing method
      7. Error control in data link layer
      8. Stop and Wait scheme
      9. Sliding Window Protocol
      10. One bit sliding window protocol
      11. A protocol Using Go-Back-N
      12. Selective repeat protocol
      13. Application layer
      1. Andrew S. Tanenbaum, David J. Wetherall, “Computer Networks” Pearson Education.
      2. Douglas E Comer, “Internetworking with TCP/IP Principles, Protocols, And Architecture",Pearson Education
      3. KavehPahlavan, Prashant Krishnamurthy, “Networking Fundamentals”, Wiley Publication.
      4. Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, McGraw Hill.