par Guilbaud, Nicolas;Goossens, Joël
Référence Critical Embedded Systems Conference - FNRS Contact Group(Louvain-la-Neuve, Belgium)
Publication Non publié, 2026-05-11
Abstract de conférence
Résumé : This contribution presents an efficient method to determine the minimum number of processors required to schedule a task set using the EDF(k) (Earliest Deadline First with k partitions) algorithm. We identify a restrictive condition under which the processor count function decreases by at least one unit at each step until it reaches a global minimum, leading to a migration-free execution.

Documents en relation

DI-fusion