Pontus Ekberg is a PhD student at Uppsala University, Sweden. There he has worked on the
 analysis of algorithms and models for real-time scheduling theory.

AG 1, AG 2, AG 3, AG 4, AG 5, SWS, RG1, MMCI   Info

AG Audience

English

-- Not specified --

Kaiserslautern

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.
  

Vera Schreiber

--email hidden

Yes

Saarbrücken

E1 5

029

passcode not visible

logged in users only