process synchronization from critical section to monitor.pptx

process synchronization

1. Process synchronization

2. Cooperating process P1  P2  P3   Data inconsistency P4  Data Bounded-Buffer : orderly execution of cooperating process

3. Common Integer  count Initially count=0 If producerproducesbuffer  count=count+1 If consumer <-- consumes <-- buffer  count=count-1

4. Critical section

5. Peterson’s Solution (provides algorithm with machine level language) LOAD and STORE (no simultaneous execution) Two process share 2 variable turn and flag If turn= i Pi enters CS Flag[ i ]=true  Pi is ready

6. Synchronization hardware Locking CS mutex lock

7. Semaphore