Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (Q1013298): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Wiesław X. Kubiak / rank
 
Normal rank
Property / author
 
Property / author: Chris N. Potts / rank
 
Normal rank

Revision as of 06:39, 10 February 2024

scientific article
Language Label Description Also known as
English
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
scientific article

    Statements

    Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors (English)
    0 references
    0 references
    0 references
    0 references
    17 April 2009
    0 references
    complexity
    0 references
    divide-and-conquer graph
    0 references
    HLF
    0 references
    identical parallel processors
    0 references
    makespan
    0 references

    Identifiers