Feasibility Analysis of Conditional DAG Tasks - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Feasibility Analysis of Conditional DAG Tasks


Feasibility analysis for Conditional DAG tasks (C-DAGs) upon multiprocessor platforms is shown to be complete for the complexity class pspace. It is shown that as a consequence integer linear programming solvers (ILP solvers) are likely to prove inadequate for such analysis. A demarcation is identified between the feasibility-analysis problems on C-DAGs that are efficiently solvable using ILP solvers and those that are not, by characterizing a restricted class of C-DAGs for which feasibility analysis is shown to be efficiently solvable using ILP solvers.
Fichier principal
Vignette du fichier
LIPIcs-ECRTS-2021-12.pdf (821.09 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-03395589 , version 1 (22-10-2021)



Sanjoy Baruah, Alberto Marchetti-Spaccamela. Feasibility Analysis of Conditional DAG Tasks. ECRTS 2021 - 33rd Euromicro Conference on Real-Time Systems, Jul 2021, Modena, Italy. pp.1-17, ⟨10.4230/LIPIcs.ECRTS.2021.12⟩. ⟨hal-03395589⟩


33 View
80 Download



Gmail Facebook X LinkedIn More