Malleable scheduling beyond identical machines

DOI10.1007/s10951-022-00733-xzbMath1527.90095OpenAlexW2978167430MaRDI QIDQ6090217

Orestis Papadigenopoulos, Dimitris Fotakis, Jannik Matuschke

Publication date: 14 November 2023

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2019/11232/

zbMATH Keywords

schedulingapproximationmakespanpackingparallelmachinesroundingrestricteduniformunrelatedjobsmalleablemoldable

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

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

This page was built for publication: Malleable scheduling beyond identical machines