Max-Planck-Institut für Informatik
max planck institut
informatik
mpii logo Minerva of the Max Planck Society
 

MPI-INF or MPI-SWS or Local Campus Event Calendar

<< Previous Entry Next Entry >> New Event Entry Edit this Entry Login to DB (to update, delete)
What and Who
Title:Complexity of the Scheduling Problem for Periodic Real-Time Tasks
Speaker:Pontus Ekberg
coming from:Uppsala University, Sweden
Speakers Bio: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.

Event Type:SWS Colloquium
Visibility:D1, D2, D3, D4, D5, SWS, RG1, MMCI
We use this to send out email in the morning.
Level:AG Audience
Language:English
Date, Time and Location
Date:Tuesday, 20 October 2015
Time:13:30
Duration:-- Not specified --
Location:Kaiserslautern
Building:G26
Room:113
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.
  
Contact
Name(s):Vera Schreiber
Video Broadcast
Video Broadcast:YesTo Location:Saarbrücken
To Building:E1 5To Room:029
Tags, Category, Keywords and additional notes
Note:
Attachments, File(s):

Created by:Vera Schreiber/MPI-SWS, 10/12/2015 09:46 AMLast modified by:Uwe Brahm/MPII/DE, 11/24/2016 04:13 PM
  • Vera Schreiber, 10/12/2015 09:53 AM -- Created document.