18, Feb, 2013 10:30-11:30 (1 hour)
CISTER, Porto, Portugal

ABSTRACT:
Unlike the uniprocessor scheduling theory which has been comprehensively studied, the scheduling of real-time tasks on multiprocessor platforms is still an evolving research field and many problems remain open due to their intrinsic difficulties. A problem that quickly became one of the major concerns in multiprocessor scheduling theory is the question of “optimality” (i.e., the ability of a particular scheduling algorithm to meet all the task deadlines for any feasible task set). However, this research field has started to lose some of its interest and research within the last few years. Indeed, the main reason for this is though many optimal scheduling algorithms for multiprocessor platforms have been designed over the years, they usually cause extensive overheads which make them unsuitable for the scheduling of realistic systems.
In this talk, we propose solutions to reduce the scheduling overheads in optimal multiprocessor scheduling algorithms and maybe make this problem once more relevant. We will also highlight the differences between discrete- and continuous-time systems. The first one basing all its scheduling decisions by relying on a system time unit while the second can schedule the execution of task for any amount of time. These two approaches exist in today's real-time operating systems and both equally deserve to be studied.

SHORT BIO:
Geoffrey Nelissen was born in Brussels, Belgium in 1985. He earned a M.Sc. degree in Electrical Engineering at Université Libre de Bruxelles (ULB), Belgium in 2008. He then worked as a Ph.D. student in the PARTS research unit of ULB. In 2012, he received a Ph.D. degree, on the topic of "Efficient Optimal Multiprocessor Scheduling Algorithms for Real-Time Systems".


WHERE:
Auditorium, CISTER, ISEP
Rua Alfredo Allen, 535
4200-135 Porto, Portugal

CISTER's main roles: