Feasibility problems for recurring tasks on one processor (Q688715): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q196891 |
||
Property / reviewed by | |||
Property / reviewed by: Hans Daduna / rank | |||
Revision as of 19:29, 10 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Feasibility problems for recurring tasks on one processor |
scientific article |
Statements
Feasibility problems for recurring tasks on one processor (English)
0 references
6 December 1993
0 references
For periodic, sporadic and hybrid task systems under deadline constraints for the tasks the authors present in a comprehensive summary their results on feasibility of scheduling the tasks on a single processor. A general criterion for feasibility is given and the complexity of the problem is investigated in detail for the different tasks systems.
0 references
deadline algorithm
0 references
periodic task
0 references
sporadic task
0 references
scheduling
0 references