Optimal code placement of embedded software for instruction caches
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
This paper presents a new code placement method for embedded software to maximize hit ratios of instruction caches. We formulate the code placement problem as an integer linear programming problem. One of the advantages of our method is that code can be moved beyond boundaries of functions, so that code placement is optimized globally. Experimental results show our method achieves 35% (max 45%) reduction of cache misses.Keywords
This publication has 7 references indexed in Scilit:
- Instruction-set matching and selection for DSP and ASIP code generationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Power analysis of embedded software: a first step towards software power minimizationIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 1994
- Procedure merging with instruction cachesPublished by Association for Computing Machinery (ACM) ,1991
- An efficient microcode compiler for application specific DSP processorsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1990
- Program optimization for instruction cachesPublished by Association for Computing Machinery (ACM) ,1989
- Achieving high instruction cache performance with an optimizing compilerPublished by Association for Computing Machinery (ACM) ,1989
- Trace Scheduling: A Technique for Global Microcode CompactionIEEE Transactions on Computers, 1981