Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication (Q2484296): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:47, 3 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication |
scientific article |
Statements
Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication (English)
0 references
1 August 2005
0 references
Heterogeneous computing
0 references
Scheduling
0 references
DAG
0 references
Task duplication
0 references
Makespan
0 references
Finish time
0 references
Distributed computing
0 references
Cluster computing
0 references
Heuristic
0 references
