Polynomial time schedulability test for periodic non-preemptive 2-task system (Q2011036)
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: Polynomial time schedulability test for periodic non-preemptive 2-task system |
scientific article; zbMATH DE number 7138140
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial time schedulability test for periodic non-preemptive 2-task system |
scientific article; zbMATH DE number 7138140 |
Statements
Polynomial time schedulability test for periodic non-preemptive 2-task system (English)
0 references
28 November 2019
0 references
periodicity
0 references
non-preemptive 2-task system
0 references
schedulability
0 references
real-time systems
0 references
scheduling
0 references
