Title :
Loop scheduling algorithms for power reduction
Author :
Yu, Ted Zhihong ; Chen, Fei ; Sha, Edwin H M
Author_Institution :
Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
Abstract :
The increasing demand for portable computing has elevated power consumption to be one of the most critical parameters for the execution of loops which constitute most of the computation of scientific applications. The reduction of a schedule length is usually considered to be opposite to the reduction of power. This paper presents a novel loop pipelining approach to reduce power consumption while reducing the schedule length. Power consumption is measured by transition activity between operands of successive operations. Both initial scheduling and loop scheduling across iterations try to reduce the transition activity at the inputs to the functional units. A series of experiments show that our method achieves considerable power dissipation and schedule length reduction
Keywords :
data flow graphs; iterative methods; pipeline processing; portable computers; scheduling; functional units; iterations; loop pipelining approach; loop scheduling algorithms; portable computing; power consumption; power dissipation; power reduction; schedule length; schedule length reduction; scientific applications; successive operations; transition activity; Computer science; Data flow computing; Energy consumption; Flow graphs; Pipeline processing; Portable computers; Power dissipation; Power engineering computing; Processor scheduling; Scheduling algorithm;
Conference_Titel :
Acoustics, Speech and Signal Processing, 1998. Proceedings of the 1998 IEEE International Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-4428-6
DOI :
10.1109/ICASSP.1998.678175