Approximation algorithms for energy-efficient scheduling of parallel jobs
DOI10.1007/S10951-020-00653-8zbMATH Open1456.90072OpenAlexW3018722057MaRDI QIDQ2215201FDOQ2215201
Authors: Alexander Kononov, Julia Viktorovna Kovalenko 
Publication date: 11 December 2020
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00653-8
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
Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization.
- Energy-efficient algorithms for non-preemptive speed-scaling
- Non-preemptive speed scaling
- From preemptive to non-preemptive speed-scaling scheduling
- On multi-processor speed scaling with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- A survey of offline algorithms for energy minimization under deadline constraints
- Speed scaling on parallel processors
- Min-energy scheduling for aligned jobs in accelerate model
- Scheduling for parallel processing
- Scheduling parallel jobs to minimize the makespan
- Title not available (Why is that?)
- Scheduling on power-heterogeneous processors
- Scalably Scheduling Power-Heterogeneous Processors
- Scheduling heterogeneous processors isn't as easy as you think
- An \(O(n^2)\) algorithm for computing optimal continuous voltage schedules
- On an on-line scheduling problem for parallel jobs
- Title not available (Why is that?)
- Energy-efficient scheduling and routing via randomized rounding
- Green scheduling, flows and matchings
- Machine speed scaling by adapting methods for convex optimization with submodular constraints
- On speed scaling scheduling of parallel jobs with preemption
- Speed scaling on parallel processors with migration
Cited In (14)
- 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
- 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)
