Off-line (Optimal) multiprocessor scheduling of dependent periodic tasks
Julie Baro, Frédéric Boniol, Mikel Cordovilla, Éric Noulard, Claire Pagetti · 2012
This paper addresses the global scheduling of constrained deadline periodic dependent task sets on multiprocessor platforms composed of identical processors. We propose two orthogonal approaches: (1) an off-line computation of a valid fixed priority assignment (2) a computation of an off-line schedule. The method in both cases is based on the efficient exploration of a finite automaton encoding all the possible executions. Even if the problems are NP-complete, we obtain rather reasonable performances as illustrated in the benchmarks.