Malleable scheduling beyond identical machines (Q6090217): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2978167430 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parallel Evaluation of General Arithmetic Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong LP formulations for scheduling splittable jobs on unrelated machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Scheduling Parallel Task Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Multiprocessor Scheduling with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on Multiprocessing Timing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays / 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: An approximation algorithm for scheduling malleable tasks under general precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for scheduling unrelated parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Precedence-Constrained Scheduling of Malleable Jobs with Preemption / 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: Towards an Architecture-Independent Analysis of Parallel Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4372680 / rank
 
Normal rank
Property / cites work
 
Property / cites work: UET scheduling with unit interprocessor communication delays / rank
 
Normal rank

Latest revision as of 13:25, 3 August 2024

scientific article; zbMATH DE number 7764703
Language Label Description Also known as
English
Malleable scheduling beyond identical machines
scientific article; zbMATH DE number 7764703

    Statements

    Malleable scheduling beyond identical machines (English)
    0 references
    0 references
    0 references
    14 November 2023
    0 references
    malleable
    0 references
    scheduling
    0 references
    packing
    0 references
    jobs
    0 references
    machines
    0 references
    parallel
    0 references
    makespan
    0 references
    unrelated
    0 references
    uniform
    0 references
    restricted
    0 references
    moldable
    0 references
    rounding
    0 references
    approximation
    0 references

    Identifiers