|Dozent:||Prof. Dr. Helmut Seidl, Dr. Michael Petter|
|Ort/Zeit:||HS 2, Wednesdays 14:00-15:30 and Tutorial: Fridays 08:30-10:00 HS 2|
|Beschreibung: ||We are discussing various advanced programming paradigms illustrated by a number of real programming languages such as e.g. Smalltalk, Java, C/C++ and others.|
Memory Models for Concurrency
- Happened-before and Sequential Consistency
- MESI and TSO
- Wait-Free & Lock-Free Algorithms
- Monitors & Condition Variables and Deadlock Prevention
- Transactional Memory
- Function Dispatching
- Mixins and Traits
- Prototype Based Programming
Mini-Topics for Talks to be announced in December
from the 16/17 Winter Semester can be found here.
- Tutorial Sheet "Happened-Before" / Solution
- Tutorial Sheet "MESI and Dekker" / Solution
- Tutorial Sheet "Semaphore and Monitors" / Solution
- Tutorial Sheet "Memory Consistency, Locks: repetition" / Solution
- Tutorial Sheet "Deadlocks" / Solution
- Tutorial Sheet "Transactional Memory" / Solution
- Tutorial Sheet "Dispatching" / Solution
- Tutorial Sheet "Inheritance Part 1" / Solution
- Tutorial Sheet "Inheritance Part 2"
If you have any questions regarding organization or content of the exercises, please contact Eugen Zalinescu (email@example.com).
Passing the exam of this course is worth 5 ECTS.
This information might not be up-to-date.
- Exam: There will be only one exam at the end of the semester
- Exam: you are allowed to bring one DIN A4 sheet of paper with notes on both sides
- Exam: in case you did not pass, you have the opportunity to take "Compiler Construction" or "Virtual Machines" next term or alternatively repeat the exam next winter