|Course:||21005 (Autumn Semester 2015)|
|Lecturer:||Prof. Oscar Nierstrasz|
|Lecture:||Wednesday, 10h15 - 12h00|
|Exercises:||Wednesday, 12h00 - 12h45|
|Place:||Engehaldenstrasse 8, 001|
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.
On successful completion of this course, you will be able to:
The final grade in the course will be based 20% on exercises and 80% on the final exam.
|2||26/Sep/12||Java and Concurrency||Assignment2|
|3||3/Oct/12||Safety and Synchronization||Assignment3|
|4||10/Oct/12||Safety Patterns + Transactional Memory||Assignment4|
|5||17/Oct/12||Liveness and Guarded Methods||Assignment5|
|6||24/Oct/12||Lab session (ExWi Pool)|
|7||31/Oct/12||Liveness and Asynchrony||Assignment7|
|9||14/Nov/12||Fairness and Optimism||Assignment9|
|10||21/Nov/12||Lab session (ExWi Pool)|
|13||12/Dec/12||Architectural Styles for Concurrency|