Algorithms for dynamic speed scaling
From MaRDI portal
Recommendations
Cited in
(20)- Energy-efficient scheduling and routing via randomized rounding
- On speed scaling via integer programming
- Best-by-simulations: a framework for comparing efficiency of reconfigurable architectures on workloads with deadlines
- Flow shop for dual CPUs in dynamic voltage scaling
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
- Dynamic speed scaling minimizing expected energy consumption for real-time tasks
- Green scheduling, flows and matchings
- DVS scheduling in a line or a star network of processors
- Speed scaling on parallel processors with migration
- Speed scaling for maximum lateness
- Flow Shop for Dual CPUs in Dynamic Voltage Scaling
- An O(n^2) algorithm for computing optimal continuous voltage schedules
- Algorithms for energy management (invited talk)
- Speed scaling for weighted flow time
- On multiprocessor temperature-aware scheduling problems
- Speed scaling on parallel processors
- Continuous speed scaling with variability: a simple and direct approach
- Minimizing energy on homogeneous processors with shared memory
- Sustaining performance while reducing energy consumption: a control theory approach
- Speed-robust scheduling revisited
This page was built for publication: Algorithms for dynamic speed scaling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3113668)
