Energy estimation of nested loop programs

Authors:
Frank Hannig;Jürgen Teich
Affiliations:
University of Paderborn, Paderborn, Germany;University of Paderborn, Paderborn, Germany
Venue:
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2002

Citing 4
Cited 0

Resource constrained scheduling of uniform algorithms

Journal of VLSI Signal Processing Systems
Parametric Analysis of Polyhedral Iteration Spaces

Journal of VLSI Signal Processing Systems - Special issue on application specific systems, architectures and processors
Loop Parallelization in the Polytope Model

CONCUR '93 Proceedings of the 4th International Conference on Concurrency Theory
Optimizing power using transformations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

An energy estimation methodology when mapping nested loop programs onto fine grained VLSI architectures is proposed. Regular loop algorithms with uniform data dependencies have some power consumption-friendly properties. E.g., using linear allocation and scheduling functions (loop transformations) results in distributed computations and communication between nearest neighbor processors. So, data can be stored locally in each processor which is essential for low power VLSI designs. We show that the chosen mapping has a significant influence on the consumed energy. Our estimation approach identifies statements with decreased operand switching activity. For these statements with reduced activity, a lower power consumption value can be directly obtained from a generated table based model to refine the estimation. Experimental results fortify the significant influence of the mapping (loop transformation).