Lectures and Labs are spread over the week, on Monday, Wednesday, Thursday, and Friday. As for what time they will be given, see below for a more precise schedule. See also the official schedule on TimeEdit.
Slides by the textbook authors can be found at:
These slides are frequently used during our lectures. They also help link the lectures to the textbooks, which we strongly recommend you study.
They can be found here.
We will try to make the slides/lecture notes available online on this page the day before each class. A new version of the slides may be uploaded after class according to what has actually been presented. We encourage you to take notes independent of the slides material available before class.
If you want to get an idea of the material covered in the course ahead of time, the lectures slides from previous course instances are available here
NOTE. This is a tentative schedule, subject to change!
|Lecture #||Date||Topic||Slides||Reading material|
|1||Mon, Jan 16||Introduction to the course||general course info slides examples||Ben-Ari 1, 2.1-2.3.|
|2||Wed, Jan 18||Races, locks and semaphores||slides examples||Ben-Ari 2.4-2.7, 2.12, 6.1-6.5, 6.9.|
|3||Wed, Jan 18||Models of concurrency and synchronization algorithms||slides examples||Ben-Ari 3.1-3.9, Herlihy & Shavit 2.3-2.4, 7.1-7.2|
|3||Fri, Jan 20||Models of concurrency and synchronization algorithms (Cont.)||slides examples||Ben-Ari 3.1-3.9, Herlihy & Shavit 2.3-2.4, 7.1-7.2|
|4||Mon, Jan 23||Synchronization problems with semaphores||slides examples||Ben-Ari 6.5-6.9|
|5||Wed, Jan 25||Monitors||slides examples||Ben-Ari 7.1-7.3, 7.5.|
|6||Fri, Jan 27||Introduction to functional programming in Erlang||slides|
|7||Wed, Feb 1||Message-passing concurrency in Erlang||slides examples|
|8||Fri, Feb 3||Synchronization problems with message-passing||slides examples|
|10||Mon, Feb 6||Parallelizing computations||slides examples||Herlihy & Shavit 16.1, 16.4|
|11||Mon, Feb 13||Parallel linked lists||slides examples||Herlihy & Shavit 9|
|12||Wed, Feb 15||Lock-free programming||slides examples||Herlihy & Shavit 10.1, 10.2, 10.5, 10.6, 18.1, 18.2|
|13||Wed, Feb 15||Verification of concurrent programs||slides||Ben-Ari 4|
|14||Fri, Feb 17||Guest lecture (TBA)|
|15||Mon, Mar 1||Revision||quiz slides|
If you want to get an idea of the material covered in the course ahead of time, here are the lecture notes used in previous editions of the course.