Compiler optimization on instruction scheduling for low power
- 8 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in Proceedings 13th International Symposium on System Synthesis
Abstract
We investigate compiler transformation techniques for the problem of scheduling VLIW instructions aimed to reduce the power consumption on the instruction bus. It can be categorized into two types: horizontal and vertical scheduling. For the horizontal case, we propose a bipartite-matching scheme. We prove that our greedy algorithm always gives the optimal switching activities of the instruction bus. In the vertical case we prove that the problem is NP-hard and propose a heuristic algorithm. Experimental results show average 13% improvements with the 4-way issue architecture and average 20% improvement with the 8-way issue architecture for power consumption of the instruction bus as compared with conventional list scheduling for an extensive set of benchmarks.Keywords
This publication has 6 references indexed in Scilit:
- Power optimization of variable voltage core-based systemsPublished by Association for Computing Machinery (ACM) ,1998
- Power analysis and minimization techniques for embedded DSP softwareIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1997
- Register Allocation and Binding for Low PowerProceedings of the 39th conference on Design automation - DAC '02, 1995
- Precomputation-based sequential logic optimization for low powerIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994
- Technology decomposition and mapping targeting low power dissipationPublished by Association for Computing Machinery (ACM) ,1993
- Fibonacci heaps and their uses in improved network optimization algorithmsJournal of the ACM, 1987