Flow Time Minimization under Energy Constraints

Jian-Jia Chen, Kazuo Iwama, Tei-Wei Kuo, Hseuh-I Lu
2007 2007 Asia and South Pacific Design Automation Conference  
Power-aware and energy-efficient designs play important roles for modern hardware and software designs, especially for embedded systems. This paper targets a scheduling problem on a processor with the capability of dynamic voltage scaling (DVS), which could reduce the power consumption by slowing down the processor speed. The objective of the targeting problem is to minimize the average flow time of a set of jobs under a given energy constraint, where the flow time of a job is defined as the
more » ... erval length between the arrival and the completion of the job. We consider two types of processors, which have a continuous spectrum of the available speeds or have only a finite number of discrete speeds. Two algorithms are given: (1) An algorithm is proposed to derive optimal solutions for processors with a continuous spectrum of the available speeds. (2) A greedy algorithm is designed for the derivation of optimal solutions for processors with a finite number of discrete speeds. The proposed algorithms are extended to cope with jobs with different weights for the minimization of the average weighted flow time. The proposed algorithms are also evaluated with comparisons to schedules which execute jobs at a common effective speed.
doi:10.1109/aspdac.2007.358098 dblp:conf/aspdac/ChenIKL07 fatcat:af2txce5dzgktajoidojh5ffny