We normally have two classes per week, one on Monday and one on Wednesday, both at 10:00–11:45. See below for a more precise schedule, where there is no lecture on dates corresponding to cells with greyed out text or no text. See the official schedule on TimeEdit for information about the rooms.
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.
|1||15 January 2018||Introduction to concurrent programming||info slides examples||Ben-Ari 1, 2.1-2.3|
|2||15 January 2018||Races, locks, and semaphores||slides examples||Ben-Ari 2.4-2.7, 2.12, 6.1-6.5, 6.9|
|3||17 January 2018||Models of concurrency & synchronization algorithms||slides examples quiz||Ben-Ari 3.1-3.9, Herlihy & Shavit 2.3-2.4, 7.1-7.2|
|4||22 January 2018||Synchronization problems with semaphores||slides examples||Ben-Ari 6.5-6.9|
|5||24 January 2018||Monitors||slides examples quiz||Ben-Ari 7.1-7.3, 7.5|
|6||29 January 2018||Introduction to functional programming in Erlang||slides||Hébert Starting out-Errors and exceptions|
|7||31 January 2018||Message-passing concurrency in Erlang||slides examples||Hébert Hitchiker’s guide to concurrency-Clients and servers|
|8||5 February 2018||Synchronization problems with message passing||slides examples quiz|
|9||5 February 2018||Parallelizing computations||slides examples||Herlihy & Shavit 16.1, 16.4|
|10||12 February 2018||Parallel linked lists||slides examples||Herlihy & Shavit 9|
|11||14 February 2018||Lock free programming||slides examples quiz||Herlihy & Shavit 10.1, 10.2, 10.5, 10.6, 18.1, 18.2|
|19 February 2018||Guest lecture: Niklas Gustavsson, Spotify|
|12||21 February 2018||Models and languages of concurrent computation||slides||Ben-Ari 9|
|13||26 February 2018||Verification of concurrent programs. Recap of main topics of the course||slides quiz||Ben-Ari 4|
If you want to get an idea of the material covered in the course before, here are the lecture notes used in previous editions of the course.