State critical section problem? Discuss three solutions to solve the critical section problem.
C-S Problem:-
- n processes all competing to use some shared data
- Every process has a code segment, called critical section, in which the shared data is accessed
- problem - make sure that when one process is executing in its critical section, no other process is allowed to implement in its critical section
Solution to the C-S problem
1. Mutual Exclusion - No two processes eat concurrently
2. Progress - If no process eats forever, and some process is hungry, then some (potententially different) hungry process eventually eats.