Energy-Efficient Algorithms for . . .：（节能的算法。）.pdfVIP

Energy-Efficient Algorithms for Flow Time Minimization SUSANNE ALBERS University of Freiburg AND HIROSHI FUJIWARA Kwansei Gakuin University Abstract. We study scheduling problems in battery-operated computing devices, aiming at schedules with low total energy consumption. While most of the previous work has focused on finding feasible schedules in deadline-based settings, in this article we are interested in schedules that guarantee good response times. More specifically, our goal is to schedule a sequence of jobs on a variable-speed processor so as to minimize the total cost consisting of the energy consumption and the total flow time of all jobs. We first show that when the amount of work, for any job, may take an arbitrary value, then no online algorithm can achieve a constant competitive ratio. Therefore, most of the article is concerned with unit-size jobs. We devise a deterministic constant competitive online algorithm and show that the offline problem can be solved in polynomial time. Categories and Subject Descriptors: F.2.2 [Analyis of Algorithms and Problem Complexity]: Non- numerical Algorithms and Problems—Sequencing and scheduling; G.2.1 [Discrete Mathematics]: Combinatorics—Combinatorial algorithms General Terms: Algorithms, Theory Additional Key Words and Phrases: Variable-speed processor, flow time, online algorithms, compet- itive analysis, offline algorithms, dynamic programming ACM Reference Format: Albers, S. and Fujiwara, H. 2007. Energy-efficient algorithms for flow time minimization. ACM Trans. Algor. 3, 4, Article 49 (November 2007), 17 pages. DOI = 10.1145/1290672.1290686 /10.1145/1290672.1290686 A preliminary version of this article appeared at the 23rd International Symposium on Theoretical Aspects of Computer Science (STACS) 2006. Part of this work was done while H. Fujiwara visited the University of Freiburg and was affiliated with the School of Informatics, Kyoto University, Japan. Autho