scientific article; zbMATH DE number 7650084

DOI10.4230/LIPICS.APPROX-RANDOM.2019.17MaRDI QIDQ5875469zbMATH OpenFDO

Authors Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos

Publication date 3 February 2023

Full work available at URL https://arxiv.org/abs/1903.11016

zbMATH Keywords

approximationschedulinguniformparallelspeedsmachinesunrelatedjobsmalleablemoldable

Mathematics Subject Classification ID

Randomized algorithms (68W20) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites work

• A $\frac32$‐Approximation Algorithm for Scheduling Independent Monotonic Malleable Tasks
• An approximation algorithm for scheduling dependent tasks on \(m\) processors with small communication delays
• An approximation algorithm for scheduling malleable tasks under general precedence constraints
• Approximation algorithms for scheduling parallel jobs
• Approximation algorithms for scheduling unrelated parallel machines
• Bounds for Multiprocessor Scheduling with Resource Constraints
• Bounds on Multiprocessing Timing Anomalies
• Complexity of Scheduling Parallel Task Systems
• Linear-Time approximation schemes for scheduling malleable parallel tasks
• Precedence-constrained scheduling of malleable jobs with preemption
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Strong LP formulations for scheduling splittable jobs on unrelated machines
• The Parallel Evaluation of General Arithmetic Expressions
• Towards an Architecture-Independent Analysis of Parallel Algorithms
• UET scheduling with unit interprocessor communication delays

Cited in

(2)

• Malleable scheduling beyond identical machines
• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5875469)