A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems (Q883272)
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 revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems |
scientific article; zbMATH DE number 5161097
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems |
scientific article; zbMATH DE number 5161097 |
Statements
A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems (English)
0 references
4 June 2007
0 references
heterogeneous computing
0 references
independent tasks
0 references
greedy heuristic
0 references
task consistency
0 references
task priority graph
0 references
0.8652498126029968
0 references
0.827957034111023
0 references
0.7925773859024048
0 references
0.7689082026481628
0 references
