An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
From MaRDI portal
Publication:5470707
DOI10.1137/050629434zbMath1122.90041OpenAlexW1991384316MaRDI QIDQ5470707
Publication date: 1 June 2006
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/050629434
Deterministic scheduling theory in operations research (90B35) Discrete location and assignment (90B80)
Related Items (21)
Energy optimal schedules for jobs with multiple active intervals ⋮ Energy-efficient deadline scheduling for heterogeneous systems ⋮ Non-preemptive speed scaling ⋮ Power and performance management for parallel computations in clouds and data centers ⋮ Min-energy scheduling for aligned jobs in accelerate model ⋮ Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional DSP ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules ⋮ From preemptive to non-preemptive speed-scaling scheduling ⋮ Power efficient rate monotonic scheduling for multi-core systems ⋮ A model for minimizing active processor time ⋮ Approximation Algorithms for Unrelated Machine Scheduling with an Energy Budget ⋮ From Preemptive to Non-preemptive Speed-Scaling Scheduling ⋮ Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics ⋮ A pseudo-linear time algorithm for the optimal discrete speed minimizing energy consumption ⋮ Speed scaling problems with memory/cache consideration ⋮ Approximation Algorithms for Variable Voltage Processors: Min Energy, Max Throughput and Online Heuristics ⋮ Speed scaling with a solar cell ⋮ Race to idle ⋮ Unnamed Item ⋮ On multi-processor speed scaling with migration ⋮ DVS scheduling in a line or a star network of processors
This page was built for publication: An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
