Little-preemptive scheduling on unrelated processors (Q1868263)
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 1901343
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Little-preemptive scheduling on unrelated processors |
scientific article; zbMATH DE number 1901343 |
Statements
Little-preemptive scheduling on unrelated processors (English)
0 references
27 April 2003
0 references
scheduling
0 references
unrelated processors
0 references
preemption
0 references
acyclic distribution
0 references
algorithm
0 references
0.90911484
0 references
0.90578896
0 references
0.9007757
0 references
0.8925805
0 references
0.8915695
0 references
0.88769853
0 references
0 references
0.88418293
0 references
0.8825351
0 references
