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 |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.jpdc.2005.01.006 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1965919411 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 21:42, 19 March 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