A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks (Q3075459)
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: A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks |
scientific article; zbMATH DE number 5851829
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A 3/2-approximation algorithm for rate-monotonic multiprocessor scheduling of implicit-deadline tasks |
scientific article; zbMATH DE number 5851829 |
Statements
A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks (English)
0 references
15 February 2011
0 references
0.7981253862380981
0 references
0.7815384268760681
0 references
0.7794399857521057
0 references
0.7741895318031311
0 references
