Computing optimal preemptive schedules for parallel tasks: linear programming approaches (Q1396837)
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: Computing optimal preemptive schedules for parallel tasks: linear programming approaches |
scientific article; zbMATH DE number 1948566
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing optimal preemptive schedules for parallel tasks: linear programming approaches |
scientific article; zbMATH DE number 1948566 |
Statements
Computing optimal preemptive schedules for parallel tasks: linear programming approaches (English)
0 references
13 July 2003
0 references
scheduling
0 references
linear programming
0 references
multiprocessor
0 references
malleable tasks
0 references
0.93155205
0 references
0.92612934
0 references
0.92314994
0 references
0.91894805
0 references
0.9182527
0 references
0.91488105
0 references
