Classroom sessions:
Monday: 12:30 - 14:00, OH14/104
Tuesday: 10:15 - 11:45, OH14/104
Start of course: Tuesday, April 18th, 2017
Credits: 8 (Basismodul)
Finals: Oral Exam. Please contact the chair secretary Claudia Graute to get a time slot for the exam.
Dates:
9. August 2017 (Wednesday) 12-14 (2 slots)
8. September 2017 (Friday) 10-14 (4 slots)
9. Oktober 2017 (Monday) 12-15 (3 slots)
If you got any questions regarding the exam dates etc. please contact Georg von der Brüggen
Exercise:
Thursday: 10:15-11:45 OH16/U08 (Group 1)
Thursday: 14:15-15:45 OH16/U08 (Group 2)
Exercises will be uploaded to the website one week before the exercise sessions. The first sheet will be uploaded at 27.04.17, the first exercise session will be at 04.05.17.
Solutions can be placed into the mailbox of LS 12 on the first floor of Otto-Hahn-Straße 16 (right corridor) until 13:00 on Wednesday.
Tutor: Georg von der Brüggen
If you got any questions regarding the exercises please write an email.
Course Introduction:
Real-time systems play a crucial role in many applications, such as avionic control systems, automotive electronics, telecommunications, industrial automation, and robotics. Such safety-critical applications require high reliability in timing assurance to prevent from serious damage to the environment and significant human loss.
In this course, we will study the foundemtals from theoretical and practical perspetives to provide formal design and verification of real-time systems. The main objectives are to introduce the basic concepts and some advanced topics in real-time systems, illustrate the most significant and state-of-the-art results in the field, and provide the basic methodologies for designing predictable computing systems which can be used to support critical control applications. The following subjects will be covered in the course:
Prerequisites:
A basic background in algorithm analysis, data structures, operating systems, and discrete math will be assumed.
Literature:
Giorgio C. Buttazzo, “Hard Real-Time Computing Systems: Predictable Scheduling Algorithms and Applications”, Springer, Second Edition, 2004. ISBN: 0-387-23137-4 (roughly 40% of the lecture)
Conference and journal papapers in the literature. To be available
References:
WCET:
Real-Time Calculus:
Multiprocessor Scheduling:
Schedule: This is the schedule from Sommersester 2017. The schedule will be updated shortly.
| Session | Subject | Slides and Supplementary Materiall | Videos |
| 17.04.17 | No Lecture - Ostermontag | ||
| 18.04.17 | Introduction of Real-Time Systems | ||
| 24.04.17 |
Task Models and Scheduling Policies |
||
| 25.04.17 |
FP Scheduling - RM and DM (I) |
Schedulability (revised on 22.05.17) (added on 22.05.17) |
|
| 27.04.17 |
Devilery of Exercise Sheet 1 |
Exercise Sheet 1 | |
| 02.05.17 |
FP Scheduling - RM and DM (II) |
||
| 04.05.17 |
Exercise 1 |
Exercise Sheet 2 | |
| 08.05.17 |
FP Scheduling - RM and DM (III) |
||
| 09.05.17 |
Non-Preemptive and Limited Preemptive Scheduling |
Non-Preemptive Scheduling | |
| 11.05.17 | Exercise 2 | ||
| 15.05.17 | EDF Scheduling | Aperiodic | 5-03.mp4 |
| 16.05.17 | Worst-Case Execution Time (WCET) (I) | WCET | |
| 18.05.17 | Exercise 3 (lab) | ||
| 22.05.17 | WCET (II) | Predictability | |
| 23.05.17 |
Resource Access Protocols |
(09:20 - 09:35: the video has an ambiguous explanation)
Job J3 has not been promoted to priority level 1 yet since Job J3 has not yet blocked job J1. But the current priority ceiling after t3 has become level 1. The priority inheritance happens at time t5.
|
|
| 25.05.17 | No Exercise (Christi Himmelfahrt) | ||
|
29.05.17 |
Resource Reservation Servers |
Servers.pdf | |
|
30.05.17 |
Resource Augmentations and Approximations |
(updated at 15:20 on 30.05.17) |
12-01.mp4 |
|
01.06.16 |
Exercise 4 (lab) |
||
|
05.06.17 |
No Lecture (Pfingstmontag) |
||
|
06.06.17 |
Real-Time Communication |
(updated at 11:50 on 19.06.17) |
|
|
08.06.17 |
Exercise 5 |
||
|
12.06.17 |
Real-Time Operating Systems |
14-RTOS-2.pdf | |
|
13.06.17 |
No Lecture |
|
|
|
15.06.17 |
No Exercise (Fronleichnam) |
Exercise Sheet 6 | |
|
19.06.17 |
Self-Suspension (1) |
Self-Suspension.pdf | |
|
20.06.17 |
Self-Suspension (2) |
||
|
22.06.17 |
Exercise 6 |
||
|
26.06.17 |
Real-Time Programming Languages |
RTPL.pdf | |
|
27.06.17 |
No Lecture |
||
|
29.06.17 |
No Exercise |
Exercise Sheet 7 | |
|
03.07.17 |
k2U Framework (1) |
k2U.pdf | |
|
04.07.17 |
k2U Framework (2) |
14-03.mp4 | |
| 06.07.17 | Exercise 7 |
Exercise Sheet 8 | |
| 10.07.17 | Real-Time Calculus | RTC-handout.pdf | |
| 11.07.17 | Multiprocessor (I) - Partitioned Scheduling |
(significantly revised on 18,07,2017) |
(1:00 - 1:02 -- the explanation regarding to proportional to the speed should be "inversely proportional" to the speed) |
| 13.07.17 | Exercise 8 | Exercise Sheet 9 | |
| 17.07.17 | Multiprocessor (II) - Partitioned Scheduling (II), Global Scheduling | Global.pdf |
(07:48 - 07:52 -> The explanation should be "There is no good result with respect to utilization bounds.) (06:52 - 07:00 -> The computation effort was undefined in my words. The efforts did not mean for time complexity. I had intention to mention the "understanding effort" but not "computation complexity". The complexity of k2U and k2Q approaches is O(n^2log n).) |
| 18.07.17 | Multiprocessor (III) - Semi-Partitioned Scheduling, DAG and openMP |
|
|
| 20.07.17 | Exercise 9 | Exercise Sheet 10 | |
| 24.07.17 |
Timing Analysis in Multicore Systems |
PROSA (external link) Networks on Chip (external link) FMTV-2016-Challenges (external link)
|
|
| 25.07.17 |
Mixed Criticality, Research and Design Trends, Model Based Design |
||
| 27.07.17 | Exercise 10 |
The schedule is preliminary and maybe changed slightly during the semester. The slides linked already are from the previous year. The slides for this term will be added / updated during the semester.
Changes in the schedule are blue (different order etc) while canceled lectures will be marked red. Black links are slides from the last semester. Blue links are slides already updated / added. Red links were changed again after the release. If they are changed more then once the date of the last change will be added.
