Worst-case analysis of scheduling heuristics of parallel systems (Q1274368)
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: Worst-case analysis of scheduling heuristics of parallel systems |
scientific article; zbMATH DE number 1238366
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Worst-case analysis of scheduling heuristics of parallel systems |
scientific article; zbMATH DE number 1238366 |
Statements
Worst-case analysis of scheduling heuristics of parallel systems (English)
0 references
12 January 1999
0 references
heuristics for multiprocessor scheduling
0 references
makespan
0 references
worst-care error bound
0 references
parallel computation
0 references
interprocessor communication
0 references
task duplication
0 references
multiprocessor task
0 references
parallel task
0 references
0.93157905
0 references
0.9125119
0 references
0.9021653
0 references
0.8986114
0 references
0.8952129
0 references
0.8939961
0 references
0.8928591
0 references
