PFair scheduling of late released tasks with constrained deadlines

---

Résumé

Pfair scheduling has usually been applied in the context of synchronous periodic task systems with implicit deadlines. This paper addresses the problem of scheduling asynchronous hard real-time tasks with constrained deadlines using a Pfair strategy on multiprocessor systems. First, we extend the notion of Pfairness to the context of asynchronous tasks with constrained deadline. Then we investigate feasibility conditions, we propose a rather efficient one and we illustrate the relevance of our criteria through some simulations.

Mots-clés

Scheduling, Fairness, Pfair feasibility