Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

ESA
2010
Springer

favoriteEmaildiscussreport

149views Algorithms» more ESA 2010»

Non-clairvoyant Speed Scaling for Weighted Flow Time

13 years 4 months ago

Non-clairvoyant Speed Scaling for Weighted Flow Time

Download www.mpi-inf.mpg.de

We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow time plus energy to total weighted flow time plus energy. We first consider the non-clairvoyant setting where the size of a job is only known when the job finishes. We show an online algorithm WLAPS that is 82 -competitive for weighted flow time plus energy under the traditional power model, which assumes the power P(s) to run the processor at speed s to be s

Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee

Real-time Traffic

Algorithms | ESA 2010 | Flow Time | Total Weighted Flow | Weighted Flow |

claim paper

Related Content

» NonClairvoyant Scheduling for Minimizing Mean Slowdown

» Speed Scaling Functions for Flow Time Scheduling Based on Active Job Count

» Nonclairvoyant Speed Scaling for Flow and Energy

» Determining the Translational Speed of a Camera from TimeVarying Optical Flow

» Optimality fairness and robustness in speed scaling designs

» Generalized Network Flow Techniques for Dynamic Voltage Scaling in Hard RealTime Systems

» Nonclairvoyant speed scaling for batched parallel jobs on multiprocessors

» Speed scaling of processes with arbitrary speedup curves on a multiprocessor

» Greedy multiprocessor server scheduling

Post Info
More Details (n/a)

Added	06 Dec 2010
Updated	06 Dec 2010
Type	Conference
Year	2010
Where	ESA
Authors	Sze-Hang Chan, Tak Wah Lam, Lap-Kei Lee

Comments (0)