Scheduling malleable parallel tasks: an asymptotic fully polynomial time approximation scheme
From MaRDI portal
(Redirected from Publication:1879360)
Recommendations
Cited in
(21)- Scheduling malleable tasks with precedence constraints
- Preemptive scheduling for approximate computing on heterogeneous machines: tradeoff between weighted accuracy and makespan
- scientific article; zbMATH DE number 1003247 (Why is no real title available?)
- An effective approximation algorithm for the malleable parallel task scheduling problem
- Approximation algorithms for scheduling parallel jobs
- Algorithms and Computation
- Resource loading with time windows
- Peak demand minimization via sliced strip packing
- Machine scheduling with resource dependent processing times
- An approximation algorithm for the general max-min resource sharing problem
- Approximation schemes for machine scheduling with resource (in-)dependent processing times
- 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
- scientific article; zbMATH DE number 1947422 (Why is no real title available?)
- 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)
