Speed Scaling with an Arbitrary Power Function
Symposium on Discrete Algorithms(2013)
摘要
All of the theoretical speed scaling research to date has assumed that the power function, which expresses the power consumption P as a function of the processor speed s, is of the form P = s�, where α > 1 is some constant. Motivated in part by technological advances, we initiate a study of speed scaling with arbitrary power functions. We consider the problem of minimizing the total flow plus energy. Our main result is a (3+ǫ)-competitive algorithm for this problem, that holds for essentially any power function. We also give a (2+ǫ)-competitive algorithm for the objective of fractional weighted flow plus energy. Even for power functions of the form s�, it was not previously known how to obtain competitiveness independent of α for these problems. We also introduce a model of allowable speeds that generalizes all known models in the literature.
更多查看译文
关键词
power function,natural algorithm,processing time,fractional weight,arbitrary power function,fractional weighted flow time,highest density first,total flow time,unfinished job,2-competitive algorithm,online scheduling problem,scheduling
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要