An approximation algorithm for scheduling trees of malleable tasks (Q1848358)

From MaRDI portal
Revision as of 23:09, 12 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An approximation algorithm for scheduling trees of malleable tasks
scientific article

    Statements

    An approximation algorithm for scheduling trees of malleable tasks (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2002
    0 references
    Parallel computing
    0 references
    Scheduling
    0 references
    Malleable tasks
    0 references
    Precedence constraints
    0 references
    Trees
    0 references

    Identifiers