Efficient approximation algorithms for scheduling moldable tasks (Q6113310): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling malleable tasks on parallel processors to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the shortest-path broadcast problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time scheduling of linear speedup parallel tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling parallel jobs online with convex and concave parallelizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online scheduling of malleable parallel jobs with setup times on two identical machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive online scheduling of perfectly malleable jobs with setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time approximation schemes for scheduling malleable parallel tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Scheduling Parallel Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the total profit of rectangles packed into a rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for online malleable job scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4335207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic of Scheduling Parallel Tasks and Its Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for scheduling monotonic moldable tasks / rank
 
Normal rank

Revision as of 16:00, 1 August 2024

scientific article; zbMATH DE number 7709804
Language Label Description Also known as
English
Efficient approximation algorithms for scheduling moldable tasks
scientific article; zbMATH DE number 7709804

    Statements

    Efficient approximation algorithms for scheduling moldable tasks (English)
    0 references
    0 references
    0 references
    11 July 2023
    0 references
    scheduling
    0 references
    approximation algorithms
    0 references
    moldable tasks
    0 references

    Identifiers