Many safety-critical systems must be inherently distributed, are subject to stringent real-time constraints, and must remain fully functional in the face of transient and, to some extent, permanent subsystem failures. In particular, cyber-physical systems—systems in which computers closely monitor and interact with the physical environment—typically exhibit this combination of requirements.
Common examples from daily life include automotive systems (e.g., anti-lock brakes, drive-by-wire functionality, etc.), air traffic control, factory automation, and the monitoring and control of the power grid. In addition to satisfying highest reliability expectations, such safety-critical systems are also often subject to certification requirements and/or formal validation efforts. That is, not only must they work in practice, but it must also be possible to formally establish their correctness a priori.
The focus of this seminar is to explore the algorithmic foundations that allow the construction of analytically sound fault-tolerant distributed real-time systems.
This is a research-oriented Masters-level course. Students are expected to have at least an undergraduate-level understanding of operating systems and distributed systems. Prior exposure to real-time systems is recommended but not required.
Students are expected to have had prior training in the principles of effective scientific communication (i.e., students should already know how to write a scientific report and how to give a proper talk). Students that do not satisfy this requirement should enroll in a “Proseminar” first. This seminar is not a public speaking class.
Due to the format of the seminar, there are only a small number of topics available. Students interested in participating in the seminar should register early using the signup form.
When: regular meetings every Tuesday from 16:00 (c.t.) to 18:00.
The first meeting is on April 23.
Where: room 005, E1 5 (MPI-SWS building, UdS Campus).
Attendance policy: Seminars thrive on lively discussions. Therefore, attendance is mandatory. Absences require prior approval by the instructors (with the obvious exception of medical emergencies).
The course is split into two phases.
Initially, there will be a few lectures covering real-time and distributed systems basics to establish a common terminology and a common ground for discussion, followed by a (short) graded quiz.
In the second phase, topics covering a small number of research papers will be assigned to participating students. Students are expected to give a lecture presenting the key concepts and techniques and write a brief synopsis of their assigned topic (4–8 pages).
The instructors reserve the right to deduct grade points for repeated failure to contribute in class.
We will cover six topic areas across seven meetings.
On May 28, presented by Björn Brandenburg and Allen Clement.
On June 4, presented by Ufuoma Bright Ighoroje and Manohar Vanga.
F. Many and D. Doose (2011), Scheduling Analysis under Fault Bursts. In Proccedings of the 17th IEEE Real-Time and Embedded Technology and Applications Symposium, pages 113–122.
I. Broster, A. Burns, and G. Rodriguez-Navas (2005). Timing Analysis of Real-Time Communication Under Electromagnetic Interference. Real-Time Systems, 30(1–2):55–81.
Optionally, read Burns et al. (1996) for a gentle introduction to the topic, and Davis et al. (2007) for some corrections pertaining to the schedulability analysis of CAN.
A. Burns, R. Davis, and S. Punnekkat (1996). Feasibility Analysis of Fault-Tolerant Real-Time Task Sets. In Proceedings of the Eighth Euromicro Workshop on Real-Time Systems, pages 29–33.
R. Davis, A. Burns, R. Bril, and J. Lukkien (2007). Controller Area Network (CAN) schedulability analysis: Refuted, revisited and revised. Real-Time Systems, 35(3):239–272.
On June 11, presented by Aastha Mehta and Mennan Selimi.
On June 25, presented by Xioafan Zhang and Xiao Chen.
On July 16, presented by Felipe Cerqueira and Raul Fernandes.
On July 23, Arpan Gujarati and Konstantin Kuznetsov.
On July 25, presented by Nicholas Merritt.