Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication (Q2484296)
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: Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication |
scientific article; zbMATH DE number 2189306
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication |
scientific article; zbMATH DE number 2189306 |
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
0.8913031816482544
0 references
0.8484024405479431
0 references
0.7911990880966187
0 references
0.7907901406288147
0 references
