A survey of offline algorithms for energy minimization under deadline constraints
From MaRDI portal
(Redirected from Publication:283261)
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
Cites work
- scientific article; zbMATH DE number 1306870 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 6472625 (Why is no real title available?)
- A fully polynomial-time approximation scheme for speed scaling with sleep state
- Algorithms for power savings
- Energy efficient scheduling and routing via randomized rounding
- Energy-efficient algorithms for non-preemptive speed-scaling
- Existence theorems of the hemivariational inequality governed by a multi-valued map perturbed with a nonlinear term in Banach spaces
- From preemptive to non-preemptive speed-scaling scheduling
- Green scheduling, flows and matchings
- Low complexity scheduling algorithm minimizing the energy for tasks with agreeable deadlines
- Low complexity scheduling algorithms minimizing the energy for tasks with agreeable deadlines
- Min-energy scheduling for aligned jobs in accelerate model
- Min-energy voltage allocation for tree-structured tasks
- New Results for Non-Preemptive Speed Scaling
- Non-preemptive speed scaling
- On multi-processor speed scaling with migration
- On the Interplay Between Global DVFS and Scheduling Tasks With Precedence Constraints
- On the Interplay of Voltage/Frequency Scaling and Device Power Management for Frame-Based Real-Time Embedded Applications
- Optimal Power-Down Strategies
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial-time algorithms for minimum energy scheduling
- Race to idle: new algorithms for speed scaling with a sleep state
- Scheduling Precedence Constrained Tasks with Reduced Processor Energy on Multiprocessor Computers
- Speed scaling of tasks with precedence constraints
- Speed scaling on parallel processors
- Speed scaling on parallel processors with migration
- Speed scaling to manage energy and temperature
- Speed scaling with an arbitrary power function
- Speed-scaling with no preemptions
- The bell is ringing in speed-scaled multiprocessor scheduling
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
- scientific article; zbMATH DE number 2040698 (Why is no real title available?)
- 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)