A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems (Q883272): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jpdc.2007.03.003 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2007.03.003 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018161377 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2007.03.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2018161377 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JPDC.2007.03.003 / rank | |||
Normal rank | |||
Latest revision as of 06:53, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A revisit of fast greedy heuristics for mapping a class of independent tasks onto heterogeneous computing systems |
scientific article |
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
