Approximation algorithms for energy-efficient scheduling of parallel jobs
From MaRDI portal
(Redirected from Publication:2215201)
Recommendations
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Makespan minimization for parallel jobs with energy constraint
- Energy efficient scheduling of parallelizable jobs
- Energy-efficient algorithms for non-preemptive speed-scaling
Cites work
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2080263 (Why is no real title available?)
- A survey of offline algorithms for energy minimization under deadline constraints
- An \(O(n^2)\) algorithm for computing optimal continuous voltage schedules
- Energy-efficient algorithms for non-preemptive speed-scaling
- Energy-efficient scheduling and routing via randomized rounding
- From preemptive to non-preemptive speed-scaling scheduling
- Geometric algorithms and combinatorial optimization.
- Green scheduling, flows and matchings
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- Min-energy scheduling for aligned jobs in accelerate model
- Non-preemptive speed scaling
- On an on-line scheduling problem for parallel jobs
- On multi-processor speed scaling with migration
- On speed scaling scheduling of parallel jobs with preemption
- Scalably Scheduling Power-Heterogeneous Processors
- Scheduling for parallel processing
- Scheduling heterogeneous processors isn't as easy as you think
- Scheduling on power-heterogeneous processors
- Scheduling parallel jobs to minimize the makespan
- Speed scaling on parallel processors
- Speed scaling on parallel processors with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
Cited in
(15)- Energy Efficient Scheduling of Parallelizable Jobs
- Minimizing total completion time in multiprocessor job systems with energy constraint
- Energy-efficient scheduling and routing via randomized rounding
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Energy efficient scheduling of parallelizable jobs
- On speed scaling scheduling of parallel jobs with preemption
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Approximation algorithms for energy, reliability, and makespan optimization problems
- Energy efficient scheduling and routing via randomized rounding
- Minimizing makespan for parallelizable jobs with energy constraint
- Approximate dynamic programming for an energy-efficient parallel machine scheduling problem
- Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget
- Makespan minimization for parallel jobs with energy constraint
- Models and algorithms for energy-efficient scheduling with immediate start of jobs
- Preemptive scheduling of parallel jobs of two sizes with controllable processing times
This page was built for publication: Approximation algorithms for energy-efficient scheduling of parallel jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2215201)
