Non-clairvoyant Speed Scaling for Weighted Flow Time
From MaRDI portal
Publication:3586448
DOI10.1007/978-3-642-15775-2_3zbMath1287.90020OpenAlexW1788468678WikidataQ58062950 ScholiaQ58062950MaRDI QIDQ3586448
Sze-Hang Chan, Lap-Kei Lee, Tak-Wah Lam
Publication date: 6 September 2010
Published in: Algorithms – ESA 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15775-2_3
Deterministic scheduling theory in operations research (90B35) Online algorithms; streaming algorithms (68W27)
Related Items (9)
Dual Techniques for Scheduling on a Machine with Varying Speed ⋮ Mechanism design for aggregating energy consumption and quality of service in speed scaling scheduling ⋮ Efficient computation of optimal energy and fractional weighted flow trade-off schedules ⋮ On the Complexity of Speed Scaling ⋮ Energy-efficient multiprocessor scheduling for flow time and makespan ⋮ Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption ⋮ Energy efficient scheduling of parallelizable jobs ⋮ Unnamed Item ⋮ Non-clairvoyant weighted flow time scheduling on different multi-processor models
This page was built for publication: Non-clairvoyant Speed Scaling for Weighted Flow Time
