A survey of offline algorithms for energy minimization under deadline constraints
From MaRDI portal
Publication:283261
DOI10.1007/s10951-015-0463-8zbMath1341.90046OpenAlexW2226422181WikidataQ59476583 ScholiaQ59476583MaRDI QIDQ283261
Philip K. F. Hölzenspies, Marco E. T. Gerards, Johann L. Hurink
Publication date: 13 May 2016
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-015-0463-8
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (7)
Energy-efficient scheduling and routing via randomized rounding ⋮ Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems ⋮ Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion ⋮ On a Reduction for a Class of Resource Allocation Problems ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ Active and Busy Time Scheduling Problem: A Survey ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Existence theorems of the hemivariational inequality governed by a multi-valued map perturbed with a nonlinear term in Banach spaces
- Non-preemptive speed scaling
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Speed scaling on parallel processors
- From preemptive to non-preemptive speed-scaling scheduling
- Min-energy scheduling for aligned jobs in accelerate model
- Speed scaling of tasks with precedence constraints
- On multi-processor speed scaling with migration
- Min-energy voltage allocation for tree-structured tasks
- The bell is ringing in speed-scaled multiprocessor scheduling
- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines
- New Results for Non-Preemptive Speed Scaling
- Speed Scaling with an Arbitrary Power Function
- Speed-Scaling with No Preemptions
- On the Interplay Between Global DVFS and Scheduling Tasks With Precedence Constraints
- Polynomial-time algorithms for minimum energy scheduling
- Energy-Efficient Algorithms for Non-preemptive Speed-Scaling
- Optimal Power-Down Strategies
- Speed scaling to manage energy and temperature
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Speed Scaling on Parallel Processors with Migration
- Green Scheduling, Flows and Matchings
- Algorithms for power savings
- Scheduling Precedence Constrained Tasks with Reduced Processor Energy on Multiprocessor Computers
- On the Interplay of Voltage/Frequency Scaling and Device Power Management for Frame-Based Real-Time Embedded Applications
- A Fully Polynomial-Time Approximation Scheme for Speed Scaling with Sleep State
- Race to idle
This page was built for publication: A survey of offline algorithms for energy minimization under deadline constraints
