{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (Q613790)
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: {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines |
scientific article; zbMATH DE number 5829098
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | {\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines |
scientific article; zbMATH DE number 5829098 |
Statements
{\textsf{LRE}}-{\textsf{TL}}: An optimal multiprocessor algorithm for sporadic task sets with unconstrained deadlines (English)
0 references
22 December 2010
0 references
multiprocessor scheduling
0 references
hard real-time systems
0 references
periodic tasks
0 references
sporadic tasks
0 references
unconstrained deadlines
0 references
0 references
0.794257640838623
0 references
0.7754935622215271
0 references
0.7695959210395813
0 references
0.7628315687179565
0 references
0.7594467401504517
0 references
