Approximation algorithms for energy-efficient scheduling of parallel jobs
From MaRDI portal
Publication:2215201
DOI10.1007/s10951-020-00653-8zbMath1456.90072MaRDI QIDQ2215201
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
90C05: Linear programming
90B35: Deterministic scheduling theory in operations research
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
68W25: Approximation algorithms
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A survey of offline algorithms for energy minimization under deadline constraints
- Non-preemptive speed scaling
- Speed scaling on parallel processors
- From preemptive to non-preemptive speed-scaling scheduling
- Min-energy scheduling for aligned jobs in accelerate model
- Scheduling parallel jobs to minimize the makespan
- Scheduling for parallel processing
- Geometric algorithms and combinatorial optimization.
- On an on-line scheduling problem for parallel jobs
- Energy-efficient scheduling and routing via randomized rounding
- Scheduling on power-heterogeneous processors
- Green scheduling, flows and matchings
- On multi-processor speed scaling with migration
- Speed scaling on parallel processors with migration
- The bell is ringing in speed-scaled multiprocessor scheduling
- An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules
- On Speed Scaling Scheduling of Parallel Jobs with Preemption
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
- Scalably Scheduling Power-Heterogeneous Processors
- Machine Speed Scaling by Adapting Methods for Convex Optimization with Submodular Constraints
