|Dozent:||Dr. Michael Petter|
|Ort/Zeit:||Wednesdays, 14:05 - 15:35 , Lecture Hall 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
- Aspect Oriented 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" / Solution
- Tutorial Sheet "Mixins and Traits" / Solution
- Tutorial Sheet "Prototype Based Programming" / Solution
Passing the exam of this course is worth 5 ECTS.
Hera are the exams from 2015 (sol) and 2016 (sol).
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 all analog helpers, e.g. books, printed slides, personal notes, etc. ; we recommend 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