Seminar Series 2015 - Damien Masson
FKP: a constant-time algorithm to schedule hard real-time sporadic tasksCISTER, Porto, Portugal
ABSTRACT:
This talk presents FKP, a scheduling algorithm for hard real-time sporadic tasks that takes its decision in constant time, and that outperforms Fixed Priority based schedulers in terms of schedulability. FKP does not make any kind of assumption on the deadline/period relation. FKP also has the property to significantly reduce the number of preemptions a job suffers, compared both with fixed Priority based schedulers and with EDF. Moreover, an exact schedulability test based on exact Worst Case Response Times computations is presented. This is a joint work with Geoffrey Nelissen.
EVENT PHOTOS:
At CISTER's Facebook page
DOWNLOAD:
PDF Presentation (3MB)
CISTER's main roles: