|
ABSTRACT
Data referencing during program execution can be a significant source of energy consumption especially for data-intensive programs. In this paper, we propose an approach to minimize such energy consumption by allocating data to proper registers and memory. Through careful analysis of boundary conditions between consecutive blocks, our approach efficiently handles various control structures including branches, merges and loops, and achieves the allocation results benefiting the whole program. The computational cost for solving the energy minimization allocation problem is rather low comparing with known approaches while the quality of the results are very encouraging.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
|
| |
2
|
|
| |
3
|
T. Burd and Brad Peters, "A Power Analysis of a Microprocessor: A Study of an Implementation of the MIPS R3000 Architecture," Technical Report, University of California, Berkeley, 1994.
|
 |
4
|
|
| |
5
|
|
 |
6
|
|
| |
7
|
G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cooke, M. E. Hopkins, and P. W. Markstein, "Register allocation via graph coloring," Computer Language, vol. 6, 1981, pp. 47-57.
|
| |
8
|
A. P. Chandrakasan, M. P. Potkonjak, R. Mehra, J. Rabaey, and R. W. Brodersen, "Optimizing power using transformations," IEEE Transactions on CAD of Integrated Circuits and Systems, vol. 14, no. 1, January 1995, pp. 12-30.
|
 |
9
|
|
| |
10
|
|
 |
11
|
|
 |
12
|
|
| |
13
|
|
| |
14
|
U. I. Gupta, D. T. Lee, and J. Y. Leung, "An optimal solution for the channel-assignment problem," IEEE Transactions on Computers, vol. c-28, no. 11, November 1979, pp. 807-810.
|
| |
15
|
|
| |
16
|
|
| |
17
|
P. E. Landman and J. Rabaey, "Activity-sensitive architectural power analysis," IEEE Transactions on CAD of Integrated Circuits and Systems, vol. 15, no. 6, June 1996, pp. 571-587.
|
| |
18
|
E. L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, 1976.
|
| |
19
|
E. Luque, A. Ripoll, and T. Diez, "Heuristic algorithms for register allocation," IEEE Proceedings-E, vol. 139, no. 1, January 1992, pp. 73-80.
|
| |
20
|
|
| |
21
|
|
 |
22
|
|
| |
23
|
|
 |
24
|
|
| |
25
|
J. Wang, Y. Jeang, M. Sheu, and J. Lee, "On the register allocation problems and algorithms," Proceedings of International Symposium on VLSI Technology, Systems, and Applications, 1989, pp. 126-128.
|
 |
26
|
|
| |
27
|
Y. Zhang, X. S. Hu, and D. Z. Chen, "Low energy register allocation beyond basic blocks" IEEE International Symposium on Circuits and Systems, 1999, pp. 290-293.
|
 |
28
|
Yumin Zhang , Xiaobo (Sharon) Hu , Danny Z. Chen, Global register allocation for minimizing energy consumption, Proceedings of the 1999 international symposium on Low power electronics and design, p.100-102, August 16-17, 1999, San Diego, California, United States
[doi> 10.1145/313817.313877]
|
|