License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ECRTS.2021.12
URN: urn:nbn:de:0030-drops-139433
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13943/
Baruah, Sanjoy ;
Marchetti-Spaccamela, Alberto
Feasibility Analysis of Conditional DAG Tasks
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.
BibTeX - Entry
@InProceedings{baruah_et_al:LIPIcs.ECRTS.2021.12,
author = {Baruah, Sanjoy and Marchetti-Spaccamela, Alberto},
title = {{Feasibility Analysis of Conditional DAG Tasks}},
booktitle = {33rd Euromicro Conference on Real-Time Systems (ECRTS 2021)},
pages = {12:1--12:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-192-4},
ISSN = {1868-8969},
year = {2021},
volume = {196},
editor = {Brandenburg, Bj\"{o}rn B.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13943},
URN = {urn:nbn:de:0030-drops-139433},
doi = {10.4230/LIPIcs.ECRTS.2021.12},
annote = {Keywords: Multiprocessor feasibility analysis, Conditional Directed Acyclic Graphs, PSPACE-complete}
}
|
Keywords: |
|
Multiprocessor feasibility analysis, Conditional Directed Acyclic Graphs, PSPACE-complete |
|
Collection: |
|
33rd Euromicro Conference on Real-Time Systems (ECRTS 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
30.06.2021 |
