Improvement of schedulability bound by task splitting in partitioning scheduling
Résumé
We focus on the class of static-priority partitioning scheduling algorithm on multiprocessor. We are interested in improving the schedulability of these algorithms by splitting the tasks which cannot be successfully allocated on processors.
Origine : Fichiers produits par l'(les) auteur(s)
Loading...