Size-constrained code placement for cache miss rate reduction
Authors:
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 96-101
Abstract
In design of an embedded system with a cache, it is important to minimize the cache miss rate to reduce the power consumption as well as to improve the performance of the system. We have previously proposed a code placement method which minimizes miss rates of instruction caches, but it makes code size larger. In most cases, code size is a tight design constraint. In this paper, we propose a size-constrained code placement method which minimizes cache miss rates under constraint on code size given by system designers. Experimental results show that the size-constrained code placement method achieves 36% decrease in cache misses with only 1.6% increase in code size compared with a naive placement, while the previous method decreases 36% of cache misses with 25% increase in code size.Keywords
This publication has 6 references indexed in Scilit:
- Optimal code placement of embedded software for instruction caches2002
- Performance estimation of embedded software with instruction cache modeling2002
- Procedure merging with instruction caches1991
- Program optimization for instruction caches1989
- Achieving high instruction cache performance with an optimizing compiler1989
- Trace Scheduling: A Technique for Global Microcode CompactionIEEE Transactions on Computers, 1981