Feasibility problems for recurring tasks on one processor (Q688715): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0304-3975(93)90360-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2009415693 / rank | |||
Normal rank | |||
Revision as of 02:02, 20 March 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
