1. Process Synchronization Topics: 1.Background 2.The critical-section problem 3.Semaphores 4.Critical Regions 5.Monitors Topics: 1.Background 2.The critical-section problem 3.Semaphores 4.Critical Regions 5.Monitors

2. Background Concurrent access to Data may result in data inconsistency To maintain data consistency we should have orderly execution of co-operating processes In the bounded buffer example, what happens I we maintain a counter to keep track of number of items produced common to producer and consumer Concurrent access to Data may result in data inconsistency To maintain data consistency we should have orderly execution of co-operating processes In the bounded buffer example, what happens I we maintain a counter to keep track of number of items produced common to producer and consumer

3. Bounded Buffer Shared Data: buffer[n],in,out,counter Producer Process: repeat produce an item in nextp while counter==n wait buffer[in]=nextp;in=(in+1)%n;counter++; until false Shared Data: buffer[n],in,out,counter Producer Process: repeat produce an item in nextp while counter==n wait buffer[in]=nextp;in=(in+1)%n;counter++; until false

4. Bounded Buffer (continued) Consumer Process repeat while counter==0 do no-op nextc=buffer[out]; counter--; consume item nextc until false Statements counter++ and counter-- have to be done atomically - no interrupt Consumer Process repeat while counter==0 do no-op nextc=buffer[out]; counter--; consume item nextc until false Statements counter++ and counter-- have to be done atomically - no interrupt

5. Critical Section Problem n processes competing to use shared data Each process has a code segment called critical section in which shared data is accessed Issue: When one process is in critical section, no other process is in critical section n processes competing to use shared data Each process has a code segment called critical section in which shared data is accessed Issue: When one process is in critical section, no other process is in critical section

6. Structure of Process repeat Critical section Remainder section until false Remainder section until false

7. Solution to Critical Section Problem 1. Mutual Exclusion: No two processes are in the critical section at the same time. 2. Progress: If no process is in the critical section and a process wishes to enter, that process cannot be postponed indefinitely 3. Bounded waiting: A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its cs and that process is granted. 1. Mutual Exclusion: No two processes are in the critical section at the same time. 2. Progress: If no process is in the critical section and a process wishes to enter, that process cannot be postponed indefinitely 3. Bounded waiting: A bound must exist on the number of times that other processes are allowed to enter their critical sections after a process has made a request to enter its cs and that process is granted.

8. Initial Attempts to solve Problem Only 2 Processes P_0 and P_1 General Structure of Process P_j (other is P_i) repeat entry section; critical section; exit section;remainder section; until false; Processes may share some common variables to synchronize their actions. Only 2 Processes P_0 and P_1 General Structure of Process P_j (other is P_i) repeat entry section; critical section; exit section;remainder section; until false; Processes may share some common variables to synchronize their actions.

9. Algorithm 1 Shared variables: int turn /* turn=j it P_jth turn*/ Process P_j repeat while (turn <> j) wait critical section; turn=I; remainder section; umtil false Shared variables: int turn /* turn=j it P_jth turn*/ Process P_j repeat while (turn <> j) wait critical section; turn=I; remainder section; umtil false

10. Algorithm 2 Shared variables: boolean flag[2] /*flag[j]=true means jth turn */ Process P_j entry section: flag[j]=true; while (flag[i]) wait; exit section: flag[j]=false; As before satisfies mutual exclusion but no progress. Shared variables: boolean flag[2] /*flag[j]=true means jth turn */ Process P_j entry section: flag[j]=true; while (flag[i]) wait; exit section: flag[j]=false; As before satisfies mutual exclusion but no progress.

11. Algorithm 3 Shared variables: flag[2], turn; Process P_j entry section: flag[j]=true; turn=j; while (flag[i] and turn==i) wait; exit section: flag[j]=false; Satisfies all three requirements- critical thing to note is turn is a shared variable. Shared variables: flag[2], turn; Process P_j entry section: flag[j]=true; turn=j; while (flag[i] and turn==i) wait; exit section: flag[j]=false; Satisfies all three requirements- critical thing to note is turn is a shared variable.

12. Bakery Algorithm Critical Section for n processors Before entering the critical section, process receives a number. Holder of the smallest number enters its critical section. If processes P_i and P_j receive the same number, if i<j, then P_i is served first else p_j is served. Numbering scheme always generates numbers in non-decreasing order. Critical Section for n processors Before entering the critical section, process receives a number. Holder of the smallest number enters its critical section. If processes P_i and P_j receive the same number, if i<j, then P_i is served first else p_j is served. Numbering scheme always generates numbers in non-decreasing order.

13. Bakery Algorithm (continued) We use lexicographic order. (a,b) < (c,d) is either a< c or a=c b< d. Shared data: Boolean choosing[n] int number[n] they are initialized to false and 0 resply. We use lexicographic order. (a,b) < (c,d) is either a< c or a=c b< d. Shared data: Boolean choosing[n] int number[n] they are initialized to false and 0 resply.

14. Bakery Algorithm (continued) Enter section: choosing[j] = true; number[j]=max of numbers +1 choosing[j]=false; for (k=0;k<n;k++) { while(choosing[k]) wait; while(number[k] <>0) and (number[k],k) <number[j],j) wait; }Leave Section: number[j]=0; Enter section: choosing[j] = true; number[j]=max of numbers +1 choosing[j]=false; for (k=0;k<n;k++) { while(choosing[k]) wait; while(number[k] <>0) and (number[k],k) <number[j],j) wait; }Leave Section: number[j]=0;

15. Synchronization Hardware Test and modify the content of a word atomically boolean Test-and-set(boolean target){ Test-and-set = target; target = true; } Test and modify the content of a word atomically boolean Test-and-set(boolean target){ Test-and-set = target; target = true; }

16. Mutual Exclusion with Test- and-set Shared data: boolean lock (initially false) Process P_j: enter section: while (Test-and-lock) wait; leave section: lock = false; Shared data: boolean lock (initially false) Process P_j: enter section: while (Test-and-lock) wait; leave section: lock = false;

17. Semaphore Synchronization tool that does not require busy wait Semaphore S - integer variable can only be accessed via two indivisible atomic operations wait(s): while (s <=0) no-op; s = s-1; signal(s): s=s+1; Synchronization tool that does not require busy wait Semaphore S - integer variable can only be accessed via two indivisible atomic operations wait(s): while (s <=0) no-op; s = s-1; signal(s): s=s+1;

18. Critical section for n processes Shared Variable: semaphore mutex; initial value of mutex=1; entersection: wait(mutex); leavesection: signal(mutex); Shared Variable: semaphore mutex; initial value of mutex=1; entersection: wait(mutex); leavesection: signal(mutex);

19. Semaphore Implementation Semaphore as a struct typedef semaphore struct { int value; ProcessList L } Two Simple operations: block - suspends the process that invokes it wakeup(P) resumes the execution of a blocked process P Semaphore as a struct typedef semaphore struct { int value; ProcessList L } Two Simple operations: block - suspends the process that invokes it wakeup(P) resumes the execution of a blocked process P

20. Semaphore Implementation (continued) Wait(S) : S.value--; if (S.value<0) { add this process to S.l; block;} Signal(S): S.value++; if (S.value<=0) {remove a process from P from S.L; wakeup(P);} Wait(S) : S.value--; if (S.value<0) { add this process to S.l; block;} Signal(S): S.value++; if (S.value<=0) {remove a process from P from S.L; wakeup(P);}

21. Implementation (continued) Wait(S) : S.value--; if (S.value<0) { add this process to S.l; block;} Signal(S): S.value++; if (S.value<=0) {remove a process from P from S.L; wakeup(P);} Wait(S) : S.value--; if (S.value<0) { add this process to S.l; block;} Signal(S): S.value++; if (S.value<=0) {remove a process from P from S.L; wakeup(P);}

22. Semaphore as General Synchronization Tool Execute B in P_j only after A is executed in P_i Use semaphore flag initialized to 0 code P_i: A ; signal(flag) Code P_j: wait(flag); B; Execute B in P_j only after A is executed in P_i Use semaphore flag initialized to 0 code P_i: A ; signal(flag) Code P_j: wait(flag); B;

23. Deadlock and Starvation Deadlock - two or more processes are waiting for indefinitely for an event that can be caused by only one of the waiting processes. S and Q are semaphores. P_0: wait(S);wait(Q);..signal(S);signal(Q); P_1:wait(Q);wait(S);..;signal(Q);signal(S); Starvation: A process may never be removed from the semaphore queue. Deadlock - two or more processes are waiting for indefinitely for an event that can be caused by only one of the waiting processes. S and Q are semaphores. P_0: wait(S);wait(Q);..signal(S);signal(Q); P_1:wait(Q);wait(S);..;signal(Q);signal(S); Starvation: A process may never be removed from the semaphore queue.

24. Two Types of Semaphores Counting Semaphore - integer value can range over an unrestricted domain Binary Semaphore - integer value can range from 0 to 1 - easier to implement. Can implement (simulate) a counting semaphore using a binary semaphore. Counting Semaphore - integer value can range over an unrestricted domain Binary Semaphore - integer value can range from 0 to 1 - easier to implement. Can implement (simulate) a counting semaphore using a binary semaphore.

25. Implementing S as a binary Semaphore Data Structures: binary_semaphore s1,s2,s3; int c; Initialization s3=s1=1; s2=0; c=initial value of semaphore Data Structures: binary_semaphore s1,s2,s3; int c; Initialization s3=s1=1; s2=0; c=initial value of semaphore

26. Implementing S (continued) Wait operation wait(s3);wait(s1);c=c-1; if (c<0) {signal(s1);wait(s2); else {signal(s1);} signal(s3); Signal Operation: wait(s1); c=c+1; if (c<=0) {signal(s2);} signal(s1); Wait operation wait(s3);wait(s1);c=c-1; if (c<0) {signal(s1);wait(s2); else {signal(s1);} signal(s3); Signal Operation: wait(s1); c=c+1; if (c<=0) {signal(s2);} signal(s1);

27. Classical Problems of Synchronization Bounded Buffer Problem Readers and writers Problem Dining Philosopher Bounded Buffer Problem Readers and writers Problem Dining Philosopher

28. Bounded Buffer Problem Shared Data String Item; String buffer[]; semaphore full,empty,mutex; item nextp,nextc; full=0;empty=n;mutex=1 Shared Data String Item; String buffer[]; semaphore full,empty,mutex; item nextp,nextc; full=0;empty=n;mutex=1

29. Producer Process Repeat { produce an item in nextp; wait(empty);wait(mutex); add nextp to buffer; signal(mutex); signal(full); } until false; Repeat { produce an item in nextp; wait(empty);wait(mutex); add nextp to buffer; signal(mutex); signal(full); } until false;

30. Consumer Process Repeat { wait(full);wait(mutex); remove an item from buffer in nextc; signal(mutex); signal(empty); consume an item in nextc; } until false; Repeat { wait(full);wait(mutex); remove an item from buffer in nextc; signal(mutex); signal(empty); consume an item in nextc; } until false;

31. Readers and Writers Problem Shared Data: Semaphore mutex,wrt;(=1) int readcount; Writer Process: wait(wrt); write; signa(wrt); Shared Data: Semaphore mutex,wrt;(=1) int readcount; Writer Process: wait(wrt); write; signa(wrt);

32. Reader Process Entersection: wait(mutex); readcount++; if (readcount==1) wait(wrt); signal(mutex); leavesection: wait(mutex);readcount-; if(reacount==0) signal(wrt); signal(mutex); Entersection: wait(mutex); readcount++; if (readcount==1) wait(wrt); signal(mutex); leavesection: wait(mutex);readcount-; if(reacount==0) signal(wrt); signal(mutex);

33. Dining Philosopher Problem Shared data: Semaphore chopstick[5](=1); Philosopher_j entersection: wait(chopstick[j]); wait(chopstick[(j+1)%5]); Leavesection: signal(chopstick[j]); signal(chopstick[(j+1)%5]); Shared data: Semaphore chopstick[5](=1); Philosopher_j entersection: wait(chopstick[j]); wait(chopstick[(j+1)%5]); Leavesection: signal(chopstick[j]); signal(chopstick[(j+1)%5]);