Description

This course provides an introduction to concurrent programming with Java. The course focuses on fundamental concepts important for developing correctly functioning concurrent programs, such as safety, liveness and fairness, and on standard programming patterns and techniques for dealing with these issues. The course will include two lab sessions (replacing the regular lecture hours) in which students will work in small groups to apply the techniques presented.

Much of the practical material in this lecture will be based on: Doug Lea, Concurrent Programming in Java: Design Principles and Patterns, Addison-Wesley, 1999. The theoretical foundations will be based on: Jeff Magee and Jeffrey Kramer, Concurrency: State Models & Java Programs, John Wiley, 1999.

Learning Outcomes

On successful completion of this course, you will be able to:

• Reason about safety, liveness and fairness in concurrent programs
• Use model-checking tools to prove safety and liveness properties
• Use synchronization mechanisms to guarantee thread safety in programs
• Reason about communication mechanisms to manage threads
• Use practical techniques to avoid deadlock and ensure liveness
• Reason about architectural styles to avoid concurrency issues

Grading

The final grade in the course will be based 30% on exercises and 70% on the final exam.

Logistics

This course will be held as a “flipped classroom.” Lectures will be made available as hour-long podcasts, with annotated slides available as PDFs. In addition there will be a weekly discussion session lasting 30 minutes to discuss the lecture material, carry out quizzes, and view live demos, followed by an exercise hour. Note that you are expected to study the lecture material in advance of the weekly discussion session.

The weekly discussion will be held in presence in the classroom (conditions permitting), but students will also be able to join remotely by Zoom. Details will be announced in the Ilias Forum.

Course Schedule