Malleable scheduling beyond identical machines

DOI10.1007/S10951-022-00733-XzbMATH Open1527.90095OpenAlexW2978167430MaRDI QIDQ6090217FDOQ6090217

Authors: Dimitris Fotakis, Jannik Matuschke, Orestis Papadigenopoulos 

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/

Recommendations

• A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
• Online malleable job scheduling for \(m\leq 3\)
• scientific article; zbMATH DE number 1003247
• Improved upper bounds for online malleable job scheduling
• Precedence-constrained scheduling of malleable jobs with preemption

zbMATH Keywords

approximationschedulingmakespanpackingrestrictedroundinguniformparallelmachinesunrelatedjobsmalleablemoldable

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

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

Cited In (1)

• Malleable scheduling for flows of jobs and applications to MapReduce

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

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