Chapter 6: Process Synchronization - Csl Mtu

More documents

Recommendations

Info

Algorithm II: 2/2 bool flag[2]; I am interested do { wait for you } flag[i] = TRUE; while (flag[j]); critical section flag[i] = FALSE; I am not interested The correctness of this algorithm is timing dependent! If both processes set enter flag[i] and flag[j] to TRUE at the same time, then both will be looping at exit the while forever and no one can enter. Bounded waiting does not hold. 18
Algorithm III: a Combination 1/4 // process P i bool flag[2]; int turn; I am interested do { yield to you first I am done flag[i] = TRUE; turn = j; while (flag[j] && turn == j); critical section flag[i] = FALSE; exit enter wait while you are interested and it is your turn. } 19
Page 1 and 2: Part II Process Management Chapter
Page 3 and 4: Why is Synchronization Needed? 1/4
Page 5 and 6: Why is Synchronization Needed? 3/4
Page 7 and 8: Race Conditions A Race Condition o
Page 9 and 10: The Critical Section Protocol do {
Page 11 and 12: Mutual Exclusion If a process P is
Page 13 and 14: Bounded Waiting After a process mad
Page 15 and 16: Algorithm I: 1/2 process P i do { w
Page 17: Algorithm II: 1/2 bool flag[2]; I a
Page 21 and 22: Algorithm III: Progress 3/4 flag[i]
Page 23 and 24: Hardware Support There are two type
Page 25 and 26: Special Machine Instructions Atomic
Page 27: Problems with Software and Hardware

Chapter 6: Process Synchronization - Csl Mtu

Create successful ePaper yourself

Delete template?

Save as template?