Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
From MaRDI portal
Publication:1879360
DOI10.1007/s00453-003-1078-6zbMath1072.90015WikidataQ94701715 ScholiaQ94701715MaRDI QIDQ1879360
Publication date: 22 September 2004
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-003-1078-6
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Asymptotically optimal scheduling of random malleable demands in smart grid, Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times, Peak demand minimization via sliced strip packing, Resource loading with time windows, Scheduling malleable tasks with precedence constraints, An effective approximation algorithm for the malleable parallel task scheduling problem, Machine scheduling with resource dependent processing times, Online malleable job scheduling for \(m\leq 3\), Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models, Multi-core real-time scheduling for generalized parallel task models, Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width, Competitive online scheduling of perfectly malleable jobs with setup times, An approximation algorithm for the general max-min resource sharing problem, Improved Algorithms for Online Scheduling of Malleable Parallel Jobs on Two Identical Machines
