Feasibility problems for recurring tasks on one processor (Q688715)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Feasibility problems for recurring tasks on one processor |
scientific article; zbMATH DE number 438340
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Feasibility problems for recurring tasks on one processor |
scientific article; zbMATH DE number 438340 |
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
0.8380227088928223
0 references
0.8380225896835327
0 references
0.8277561664581299
0 references
0.8185039162635803
0 references
