Efficient computation of optimal energy and fractional weighted flow trade-off schedules
From MaRDI portal
Publication:2408929
DOI10.1007/s00453-016-0208-xzbMath1372.68040OpenAlexW2507509145MaRDI QIDQ2408929
Mario Consuegra, Peter Kling, Neal Barcelo, Michele Scquizzato, Michael Nugent, Kirk R. Pruhs, Antonios Foivos Antoniadis
Publication date: 10 October 2017
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2014/4447/
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Unnamed Item
- Speed Scaling with an Arbitrary Power Function
- On the Complexity of Speed Scaling
- Efficient Computation of Optimal Energy and Fractional Weighted Flow Trade-off Schedules
- Scheduling for Speed Bounded Processors
- Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
- Speed Scaling for Weighted Flow Time
- Non-clairvoyant Speed Scaling for Weighted Flow Time
- Algorithm Theory - SWAT 2004
- Dual Techniques for Scheduling on a Machine with Varying Speed
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
- Energy-Efficient Algorithms for Flow Time Minimization
This page was built for publication: Efficient computation of optimal energy and fractional weighted flow trade-off schedules