Scheduling directed a-cyclic task graphs on a bounded set of heterogeneous processors using task duplication (Q2484296)

From MaRDI portal
Revision as of 21:42, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers