By Topic

Optimizing energy consumption under flow and stretch constraints

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhi Zhang ; Department of Computer Science, George Mason University, Fairfax, Virginia 22030 ; Fei Li

In embedded systems and data-center systems (systems, for short), it is widely accepted that energy consumption has become the bottleneck of system's performance improvement and it is one of the most significant factors to optimize. Unfortunately, an effective energy-aware strategy usually has an adverse impact on a job's flow time or stretch - two important user-perspective system performance metrics. In some cases, the more energy is saved by an energy-aware policy, the more flow time and the larger stretch occur to jobs. In this paper, we investigate the impact on job processing delay introduced by power-down energy-saving mechanisms. Specifically, we study bicriteria algorithms that minimize maximum flow time or largest stretch under a fixed energy budget and minimize total energy consumption under an upper bound of flow time or stretch. We develop optimal offline algorithms to quantitatively balance the system-perspective performance metric (energy consumption) and the user-perspective performance metric (flow time and stretch). We also develop two simple min-energy online algorithms against weakened adversaries. We prove that (1.) with appropriate extra flow time, an online algorithm can beat any non-idling algorithm, in terms of energy consumption; (2.) a deterministic online algorithm which has a bounded times of optimal stretch, is optimal in terms of competitive ratio with respect to energy consumption.

Published in:

30th IEEE International Performance Computing and Communications Conference

Date of Conference:

17-19 Nov. 2011