Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
DOI10.1007/S00453-003-1078-6zbMATH Open1072.90015DBLPjournals/algorithmica/Jansen04OpenAlexW2116636977WikidataQ94701715 ScholiaQ94701715MaRDI QIDQ1879360FDOQ1879360
Authors: Klaus Jansen 
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
Recommendations
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cited In (21)
- Scheduling malleable tasks with precedence constraints
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- Title not available (Why is that?)
- Approximation algorithms for scheduling parallel jobs
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Algorithms and Computation
- Peak demand minimization via sliced strip packing
- Resource loading with time windows
- Machine scheduling with resource dependent processing times
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- An approximation algorithm for the general max-min resource sharing problem
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds
- Asymptotically optimal scheduling of random malleable demands in smart grid
- Multi-core real-time scheduling for generalized parallel task models
- Improved algorithms for online scheduling of malleable parallel jobs on two identical machines
- Competitive online scheduling of perfectly malleable jobs with setup times
- Online malleable job scheduling for \(m\leq 3\)
- Scheduling trees of malleable tasks for sparse linear algebra
- Title not available (Why is that?)
- Online scheduling of parallelizable jobs in the directed acyclic graphs and speed-up curves models
- Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width
This page was built for publication: Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1879360)
