Non-clairvoyant Speed Scaling for Weighted Flow Time

DOI10.1007/978-3-642-15775-2_3MaRDI QIDQ3586448zbMATH OpenOpenAlexWikidataFDO

Authors 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

Mathematics Subject Classification ID

Online algorithms; streaming algorithms (68W27) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Speed scaling for weighted flow time
• Speed scaling for weighted flow time
• Nonclairvoyant speed scaling for flow and energy
• Nonclairvoyant speed scaling for flow and energy
• Non-clairvoyant scheduling for weighted flow time
• Minimizing flow time nonclairvoyantly
• Minimizing weighted flow time
• scientific article; zbMATH DE number 2079378
• Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
• Non-clairvoyant weighted flow time scheduling on different multi-processor models

Cited in

(12)

• Energy efficient scheduling of parallelizable jobs
• Non-clairvoyant weighted flow time scheduling on different multi-processor models
• Efficient computation of optimal energy and fractional weighted flow trade-off schedules
• On the complexity of speed scaling
• Dual techniques for scheduling on a machine with varying speed
• Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count
• Energy-efficient multiprocessor scheduling for flow time and makespan
• Scheduling under dynamic speed-scaling for minimizing weighted completion time and energy consumption
• Nonclairvoyant speed scaling for flow and energy
• Non-clairvoyant scheduling for weighted flow time and energy on speed bounded processors
• Scheduling heterogeneous processors isn't as easy as you think
• Nonclairvoyant speed scaling for flow and energy

This page was built for publication: Non-clairvoyant Speed Scaling for Weighted Flow Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3586448)