Min-energy voltage allocation for tree-structured tasks
From MaRDI portal
Publication:2369975
DOI10.1007/S10878-006-7910-6zbMATH Open1255.90063OpenAlexW2014365311MaRDI QIDQ2369975FDOQ2369975
Authors: Minming Li, Becky Jie Liu, Frances F. Yao
Publication date: 21 June 2007
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-006-7910-6
Recommendations
Cites Work
Cited In (16)
- Computing and Combinatorics
- Speed scaling with a solar cell
- Non-preemptive speed scaling
- A survey of offline algorithms for energy minimization under deadline constraints
- Approximation algorithms for variable voltage processors: min energy, max throughput and online heuristics
- An \(O(n^2)\) algorithm for computing optimal continuous voltage schedules
- Min-energy scheduling for aligned jobs in accelerate model
- DVS scheduling in a line or a star network of processors
- On one problem of construction of energy-saving schedules
- Mathematical Foundations of Computer Science 2005
- Race to idle: new algorithms for speed scaling with a sleep state
- Min-energy scheduling for aligned jobs in accelerate model
- On multi-processor speed scaling with migration
- Energy-efficient deadline scheduling for heterogeneous systems
- Power and performance management for parallel computations in clouds and data centers
- Race to idle: new algorithms for speed scaling with a sleep state
This page was built for publication: Min-energy voltage allocation for tree-structured tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2369975)