Pontus Ekberg, Uppsala Universitet(hosted by Björn Brandenburg)
"Complexity of the Scheduling Problem for Periodic Real-Time Tasks"
Abstract: In real-time scheduling theory we are interested in finding out whether a set of repeatedly activated computational tasks can be co-executed on a shared computer platform, such that all of their deadlines are met. The periodic and sporadic task models are among the most basic formalisms used for modeling computational tasks. Among computer platforms considered, the preemptive uniprocessor is one of the simplest. To decide whether a given set of periodic or sporadic tasks can be scheduled on a preemptive uniprocessor so that all deadlines are met is therefore a core problem in real-time scheduling theory. Still, the complexity of this decision problem has long been open. In this talk, which is targeted to a general audience, I will outline some recent results pinpointing this complexity.
|Time:||Tuesday, 20.10.2015, 1:30 pm|
|Place:||MPI-SWS Kaiserslautern Paul Ehrlich Str. 26, room 113|
|Video:||Simultaneous video cast to MMPI-SWS Saarbrücken, Campus E1 5, room 029|