Concurrent Programming Lectures:

This list is tentative and may be modified at the instructor's discretion.

Dates	Lecture slides	Reading (Ben-Ari unless noted)	Notes and Additional Reading
September 24, 2008	Intro, Hardware Basics Threads and Basic Terminology Processes: Scheduling and Inter-Process Communication, Race Conditions and Volatile Variables	Chapter 1-2	Review: Overview of Sequential Programming Part 1 Part 2
October 1, 2009	Java and Threads Concurrency with Critical Sections: Livelock, Deadlock, Fairness	Chapter 3	More on Livelock
October 8, 2009	Concurrency with Critical Sections: Livelock, Deadlock, Fairness Mutual Exclusion	Chapter 4
October 15, 2009	Lamport's Bakery Algorithm and Proofs of Correctness Temporal Logic	Chapter 5	Reasoning about Concurrency
October 22, 2009	Semaphores Solving Classical Problems with Semaphores	Chapter 6
October 29, 2009	Midterm		Last Week to Withdraw
November 5, 2009	Solving Classical Problems with Semaphores Designing non-trivial threaded applications for efficiency: a data-centric model Monitors	Chapter 7
November 12, 2009	Monitors Solving Classical Problems with Monitors	Chapter 7
November 19, 2009	Solving Classical Problems with Monitors Deadlock with Semaphores and Monitors	OS Chapter 7
November 26, 2009	No Class; University Holiday		No Class
December 3, 2009	Deadlock with Semaphores and Monitors Message Passing: Remote Procedure Calls RMI Distributed Mutual Exclusion Distributed Computing: Service Oriented Architectures	Chapter 10
December 10, 2009	Final Exam (studyguide) in our usual class and time