Algorithms and complexity for periodic real-time scheduling (Q2933634)
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 6377146
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and complexity for periodic real-time scheduling |
scientific article; zbMATH DE number 6377146 |
Statements
Algorithms and complexity for periodic real-time scheduling (English)
0 references
5 December 2014
0 references
approximation algorithms
0 references
erliest deadline first
0 references
computational complexity
0 references
feasibility test
0 references
inapproximability
0 references
periodic task system
0 references
real-time scheduling
0 references
0.9815976023674012
0 references
0.8694425821304321
0 references
0.8690282702445984
0 references
0.8649274110794067
0 references
