We will conduct an oral examination on March 9 in room 36/429 (Prof. Schmitt's office).
The objective of this lecture is to introduce the art of performance-related modeling of distributed systems. We will use worst-case assumptions in order to obtain robust results.
Please register here in order to get lecture updates via email!
Two consecutive lectures every Friday in 48-453
The lecture material is only accessible from within the university network (131.246.*). Please use SSH or VPN for remote access.
|Motivation, PI-Problem||November 17, 2017||PDF, PDF|
|Introduction||November 17, 2017|
|MinPlusAlgebra||November 17, 2017|
|Network Calculus Part I||November 17, 2017|
|Network Calculus Part II||December 1, 2017|
|Network Calculus Part III||December 1, 2017|
|Timed Automata||January 19, 2018|
We strongly recommend you to work on the exercises, since they are crucial to get a good grasp on math-heavy lectures. Moreover, exercise content can and will be part of exam.
|Exercise||Day of Presentation
|Jan 19, see Timed Automata Templates|
- Jean-Yves Le Boudec, Patrick Thiran. Network Calculus. Springer, 2001. (Also →available online)