1. 240-323, Part II Process Synchronization
Department of Computer Engineering, PSU Wannarat Suntiamorntut
, Part II Process Synchronization
OS,2000

2. Department of Computer Engineering, PSU Wannarat Suntiamorntut
Thread
OS,2000

3. Consumer - Producer : Share Memory
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Consumer - Producer : Share Memory
OS,2000

4. Problem with Share memory solution
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Problem with Share memory solution
OS,2000

5. Department of Computer Engineering, PSU Wannarat Suntiamorntut
Definition Term
OS,2000

6. Critical-Section Problem
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Critical-Section Problem
OS,2000

7. Critical-Section Problem (Algorithm 1)
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Critical-Section Problem (Algorithm 1)
OS,2000

8. Critical-Section Problem (Algorithm 2)
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Critical-Section Problem (Algorithm 2)
OS,2000

9. Critical-Section Problem (Algorithm 3)
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Critical-Section Problem (Algorithm 3)
OS,2000

10. Critical-Section (Many Processes)
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Critical-Section (Many Processes)
OS,2000

11. Bakery Algorithm : Explained
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Bakery Algorithm : Explained
OS,2000

12. Synchronize Hardware 240-323 OS,2000
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Synchronize Hardware
OS,2000

13. Test and Set for Mutual Exclusion
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Test and Set for Mutual Exclusion
OS,2000

14. Department of Computer Engineering, PSU Wannarat Suntiamorntut
Semaphores
OS,2000

15. Department of Computer Engineering, PSU Wannarat Suntiamorntut
Using Semaphores
OS,2000

16. Implement Semaphores 240-323 OS,2000
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Implement Semaphores
OS,2000

17. Implementing Semaphores
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Implementing Semaphores
OS,2000

18. Dead locks and Starvation
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Dead locks and Starvation
P0 P1
wait(S); wait(Q);
wait(Q); wait(S);
. .
Signal(S); Signal(Q);
Signal(Q); Signal(S) ;
OS,2000

19. a semaphore with an integer value that can range only between 0 and 1.
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Binary Semaphores
a semaphore with an integer value that can range only between 0 and 1.
Can be simpler to implement
Wait : wait(S1);
C := C -1;
if C < 0 then
signal(S1);
wait(S2);
end
Signal : wait(S1);
C := C +1;
if C =< 0 then
signal(S2);
else
wait(S1);
OS,2000

20. Readers/Writers Problem
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Readers/Writers Problem
OS,2000

21. Readers have Priority 240-323 OS,2000
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Readers have Priority
OS,2000

22. Comment on Reader Priority
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Comment on Reader Priority
OS,2000

23. Writer have Priority 240-323 OS,2000
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Writer have Priority
OS,2000

24. Note on Writer have Priority
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Note on Writer have Priority
OS,2000

25. Dining-Philosophers Problem
Department of Computer Engineering, PSU Wannarat Suntiamorntut
Dining-Philosophers Problem
OS,2000