An approximation algorithm for scheduling trees of malleable tasks (Q1848358): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Optimal online scheduling of parallel jobs with dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252325 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4864234 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526977 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank

Revision as of 18:44, 4 June 2024

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
    0 references
    0 references
    0 references
    0 references
    Parallel computing
    0 references
    Scheduling
    0 references
    Malleable tasks
    0 references
    Precedence constraints
    0 references
    Trees
    0 references