PPT-What Change History Tells Us about Thread Synchronization

Rui Gu Guoliang Jin Linhai Song Linjie Zhu Shan Lu University of Wisconsin Madison USA Proper Thread Synchronization is Hard Very easy to get things wrong H ardtofind concurrency bugsData race Atomicity Violation Dead Lock. : Adaptively . Combining Pessimistic and. Optimistic Synchronization for Efficient Parallel Runtime Support. Man Cao. Minjia. Zhang. Michael D. Bond. 1. Dynamic Analyses for Parallel Programs. Data Race Detector, . Hakim Weatherspoon. CS 3410, Spring 2013. Computer Science. Cornell University. P&H Chapter . 2.11 and 5.8. Big Picture: Parallelism and Synchronization. How do I take advantage of multiple processors; . 15-213: Introduction to Computer Systems. 24. th. Lecture, Nov. 18, 2010. Instructors:. . Randy Bryant and Dave O’Hallaron. Today. Producer-consumer problem. Readers-writers problem. Thread safety. Exercise . 1 . Let S be a . semaphore . that is initialized to 2. Consider the following:. d. own(S). d. own(S). u. p(S). d. own(S). Does this program block?. 2. Exercise 1: Answer. No. The first . down. CSCI 201L. Jeffrey Miller, Ph.D.. http://www-scf.usc.edu/~csci201. USC CSCI 201L. Outline. USC CSCI 201L. 2. /9. Synchronization. Critical Section. Motivation for Synchronization. Thread synchronization is used to coordinate the execution of dependent threads. 15-213 / 18-213: Introduction to Computer Systems. 25. th. Lecture, Nov. . 21, 2013. Instructors:. . Randy Bryant, Dave . O’Hallaron, . and . Greg . Kesden. Review: . Semaphores. Semaphore. :. . Slides from:. . Computer . Systems: A Programmer's Perspective, 2nd Edition. by Randal E. Bryant and David R. . O'Hallaron. , Prentice Hall, 2011. . Last Lecture . Sharing. Synchronization. Critical Sections and Unsafe Regions. : Adaptively . Combining Pessimistic and. Optimistic Synchronization for Efficient Parallel Runtime Support. Man Cao. Minjia. Zhang. Michael D. Bond. 1. Dynamic Analyses for Parallel Programs. Data Race Detector, . Hakim Weatherspoon. CS 3410, Spring 2013. Computer Science. Cornell University. P&H Chapter 2.11 and 5.8. Big Picture: Parallelism and Synchronization. How do I take advantage of multiple processors; . 15-213: Introduction to Computer Systems. 23. rd. Lecture, Nov. 16, 2010. Instructors:. . Randy Bryant and Dave O’Hallaron. Today. Threads review. Sharing. Mutual exclusion. Semaphores. Process: Traditional View. 15-213 / 18-213: Introduction to Computer Systems. 25. th. Lecture, Nov. . 27, 2012. Instructors:. . Dave O’Hallaron, Greg Ganger, and Greg . Kesden. Today. Races. Locking and Deadlocks. Producer-consumer problem. Hakim Weatherspoon. CS 3410, Spring 2015. Computer Science. Cornell University. P&H Chapter 2.11, 5.10,. and 6.5. Announcements. HW2 Review Sessions!. TODAY, Tue, . April 21st. , . Hollister B14@7pm. Professor Hugh C. Lauer. CS-3013, Operating Systems. (Slides include . copyright materials . Modern . Operating Systems. , 3. rd. ed., by Andrew Tanenbaum and from . Operating System Concepts. , 7. th. 15-213 / 18-213: Introduction to Computer Systems. 24. th. Lecture, Nov. 18, 2014. Instructors:. . Greg Ganger, Greg . Kesden. , and Dave . O’Hallaron. Today. Races. Locking and Deadlocks. Producer-consumer problem.