A survey of offline algorithms for energy minimization under deadline constraints
DOI10.1007/S10951-015-0463-8zbMATH Open1341.90046OpenAlexW2226422181WikidataQ59476583 ScholiaQ59476583MaRDI QIDQ283261FDOQ283261
Authors: Marco E. T. Gerards, Philip K. F. Hölzenspies, 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
Recommendations
- Algorithms for energy management (invited talk)
- scientific article; zbMATH DE number 2079319
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Algorithms for power savings
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Title not available (Why is that?)
- Speed scaling of tasks with precedence constraints
- Optimal Power-Down Strategies
- Algorithms for power savings
- Energy efficient scheduling and routing via randomized rounding
- 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
- 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
- Speed scaling to manage energy and temperature
- Existence theorems of the hemivariational inequality governed by a multi-valued map perturbed with a nonlinear term in Banach spaces
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Speed scaling on parallel processors with migration
- Speed scaling on parallel processors
- Green scheduling, flows and matchings
- 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
- Title not available (Why is that?)
- Race to idle: new algorithms for speed scaling with a sleep state
- Min-energy scheduling for aligned jobs in accelerate model
Cited In (13)
- Energy-efficient scheduling and routing via randomized rounding
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- Approximate schedules for non-migratory parallel jobs in speed-scaled multiprocessor systems
- Speed scaling scheduling of multiprocessor jobs with energy constraint and makespan criterion
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
- Approximation algorithms for energy-efficient scheduling of parallel jobs
- Title not available (Why is that?)
- Complexity and heuristic algorithms for speed scaling scheduling of parallel jobs with energy constraint
- Algorithms for energy management (invited talk)
- Active and busy time scheduling problem: a survey
- Models and algorithms for energy-efficient scheduling with immediate start of jobs
- On a Reduction for a Class of Resource Allocation Problems
This page was built for publication: A survey of offline algorithms for energy minimization under deadline constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q283261)