Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard (Q7028337)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7983603
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard |
scientific article; zbMATH DE number 7983603 |
Statements
Feasibility analysis of recurrent DAG tasks is \(\mathsf{PSPACE}\)-hard (English)
0 references
12 February 2025
0 references
real-time scheduling
0 references
computational complexity
0 references
precedence constraints
0 references
sporadic task system
0 references
feasibility testing
0 references
parallel computing
0 references
0 references
