We are currently addressing problems related to real-time scheduling. Two main areas of concern can be distinguished: Multiprocessor scheduling and Schedulability analysis.
On multiprocessor scheduling, we study primarily global multiprocessor scheduling, where all tasks that have arrived but have not finished their execution are stored in one queue (shared among all processors). At any time instant the m highest-priority tasks in that queue are selected for execution on the m processors using preemption and migration if necessary.
The study of Schedulability analysis has been mostly looking to the case where soft real-time task have stochastic characteristics (either stochastic inter-arrivals or executions times) and there are constrains on the long-run fraction of the deadlines that are missed.
In the Publications Section of this web site some of the results within by theses lines of research can be found.