Min-energy scheduling for aligned jobs in accelerate model
From MaRDI portal
Publication:631774
DOI10.1016/j.tcs.2010.12.013zbMath1209.68071OpenAlexW2084987468MaRDI QIDQ631774
Enhong Chen, Minming Li, Weiwei Wu
Publication date: 14 March 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.013
Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
A survey of offline algorithms for energy minimization under deadline constraints ⋮ Approximation algorithms for energy-efficient scheduling of parallel jobs ⋮ An $$O(n^2)$$ Algorithm for Computing Optimal Continuous Voltage Schedules
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Speed Scaling with an Arbitrary Power Function
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Min-Energy Scheduling for Aligned Jobs in Accelerate Model
- Algorithm Theory - SWAT 2004
- Energy Efficient Deadline Scheduling in Two Processor Systems
- Nonclairvoyant Speed Scaling for Flow and Energy
- Online Deadline Scheduling with Bounded Energy Efficiency
- Energy-Efficient Algorithms for Flow Time Minimization
- An Efficient Algorithm for Computing Optimal Discrete Voltage Schedules
This page was built for publication: Min-energy scheduling for aligned jobs in accelerate model
