Search

Your search keyword '"Conditional directed acyclic graphs"' showing total 2 results
Start Over Descriptor "Conditional directed acyclic graphs" Search Limiters Available in Library Collection
2 results on '"Conditional directed acyclic graphs"'

1. Feasibility Analysis of Conditional DAG Tasks

Author

Sanjoy Baruah and Alberto Marchetti-Spaccamela, Baruah, Sanjoy, Marchetti-Spaccamela, Alberto, Sanjoy Baruah and Alberto Marchetti-Spaccamela, Baruah, Sanjoy, and Marchetti-Spaccamela, Alberto

Abstract

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.

Published
2021
Full Text
View/download PDF

2. Feasibility analysis of conditional DAG tasks

Author

Baruah, Sanjoy, Marchetti-Spaccamela, Alberto, Washington University in Saint Louis (WUSTL), Dipartimento di Ingegneria informatica automatica e gestionale [Roma] (DIAG UNIROMA), Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome] (UNIROMA), Equipe de recherche européenne en algorithmique et biologie formelle et expérimentale (ERABLE), Inria Grenoble - Rhône-Alpes, Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria), Dipartimento di Ingegneria informatica automatica e gestionale (DIAG), and Università degli Studi di Roma 'La Sapienza' = Sapienza University [Rome]

Subjects
TheoryofComputation_COMPUTATIONBYABSTRACTDEVICES, Software and its engineering → Real-time schedulability, [INFO]Computer Science [cs], Conditional directed acyclic graphs, Multiprocessor feasibility analysis, PSPACE-complete, Computer systems organization → Embedded and cyber-physical systems, MathematicsofComputing_DISCRETEMATHEMATICS
Abstract

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., LIPIcs, Vol. 196, 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021), pages 12:1-12:17

Published
2021
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results