1 / 25

240-323, Part II Process Synchronization

Department of Computer Engineering, PSU Wannarat Suntiamorntut. 240-323, Part II Process Synchronization. Department of Computer Engineering, PSU Wannarat Suntiamorntut. Thread. Department of Computer Engineering, PSU Wannarat Suntiamorntut. Consumer - Producer : Share Memory.

nerice
Download Presentation

240-323, Part II Process Synchronization

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

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

  2. Department of Computer Engineering, PSU Wannarat Suntiamorntut Thread

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

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

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

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

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

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

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

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

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

  12. Department of Computer Engineering, PSU Wannarat Suntiamorntut Synchronize Hardware

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

  14. Department of Computer Engineering, PSU Wannarat Suntiamorntut Semaphores

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

  16. Department of Computer Engineering, PSU Wannarat Suntiamorntut Implement Semaphores

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

  18. 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) ;

  19. 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 Signal : wait(S1); C := C +1; if C =< 0 then signal(S2); else wait(S1); Wait : wait(S1); C := C -1; if C < 0 then signal(S1); wait(S2); end signal(S1);

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

  21. Department of Computer Engineering, PSU Wannarat Suntiamorntut Readers have Priority

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

  23. Department of Computer Engineering, PSU Wannarat Suntiamorntut Writer have Priority

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

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

More Related