Tradeoff between Energy and Throughput for Online Deadline Scheduling

The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to manage its rate of energy usage). These algorithms aim at minimizing the energy usage to complete all given jobs or to achieve the maximum throughput. Note that throughput is the primary concern for these algorithms. In this paper we consider a more general objective for studying the tradeoff between throughput and energy for deadline scheduling. Specifically, we assume each job is associated with a user-defined value (or importance) and a deadline. We allow a scheduling algorithm to discard some of the jobs (i.e., not finishing them by their deadlines), and the objective is to minimize the total energy usage plus the total value of jobs discarded. We give new online algorithms under both the unbounded-speed and bounded-speed models. When the maximum speed is unbounded, we give an O(1)-competitive algorithm. ...

• Type: Journal
• Year: 2010
• Where: WAOA
• Authors: Ho-Leung Chan, Tak Wah Lam, Rongbin Li
• Keywords: Algorithm, Algorithms, Energy Usage, Maximum Speed, WAOA 2010