FCDS Summer Term 2025

Concurrent Programming

To write correct, concurrent algorithms, we need to synchronize the access to shared variables. Synchronization introduces overheads that can slow down threads. It might even cause some threads to make no progress (livelocks, deadlocks). The main underlying idea is to ensure that a concurrent program as a whole always makes progress (lock-free) and ideally, each thread makes progress (wait-free).

This course includes two lectures on Tuesdays. One starting at 9:20 and the second at 11:10. 

 

• Slides below are from the previous year. They will be continuously updated shortly before the lecture slot with newer content.

Lecture Slides: Tuesdays 9:20 am - 12:40 pm