A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Contrarily to all other existing optimal multiprocessor scheduling algorithms for sporadic tasks, U-EDF is not based on the fairness property. ... A multiprocessor scheduling algorithm named U-EDF, was presented in  for the scheduling of periodic tasks with implicit deadlines. ... In this work, we propose an optimal extension of EDF to multiprocessor (named U-EDF) which is optimal for the scheduling of sporadic tasks with implicit deadlines. ...doi:10.1109/ecrts.2012.36 dblp:conf/ecrts/NelissenBNGM12 fatcat:s4bqnomhergzlisj2mdwccjiva
It thus leads us to designing three unfair-but-optimal scheduling algorithms on both continuous and discrete-time models. ... Especially, our unfair-but-optimal scheduling algorithm on a discrete-time model is, to the best of our knowledge, the first in the problem domain. ... Based on this observation, an unfair-but-optimal U-EDF was proposed. ...arXiv:1810.08342v1 fatcat:bljx6lcikjacrglkd2owxhcjsy
Based on this observation, an unfair-but-optimal U-EDF was proposed. ... Thus, they proposed U-EDF, an unfair but still RT-optimal scheduling algorithm, and they showed that U-EDF performs better than the existing fairnessbased algorithms in reducing the scheduling overhead ... Corollary 2. fn-EDF on the discrete-time model is an RToptimal real-time scheduling algorithm. Proof. ...doi:10.1109/access.2020.3024692 fatcat:eurax3sbljastmcktl3wdoshse
Optimal multiprocessor real-time schedulers incur significant overhead for preemptions and migrations. ... RUN significantly outperforms existing optimal algorithms with an upper bound of O(log m) average preemptions per job on m processors (fewer than 3 per job in all of our simulated task sets) and reduces ... In a recent work (Nelissen et al. 2011 ), a new algorithm called U-EDF (Unfair scheduling algorithm based on EDF) has been proposed. ...doi:10.1007/s11241-012-9165-x fatcat:asxegbqq6bedbilfgzevsntvre
This article presents the main real-time scheduling policies available to homogeneous 17 multiprocessor architectures. ... Cette présentation a pour but de gui-13 der le lecteur à travers la très grande profusion d'articles dans ce domaine et lui fournir les 14 principales clefs de compréhension des algorithmes. ... L'algorithme U-EDF est une politique multiprocesseur optimale pour des tâches 396 sporadiques à échéances implicites (Nelissen et al., 2012). ...doi:10.3166/jesa.48.613-639 fatcat:5euqsdug7reyvbz2jr4jia7h4u