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.
| Original language | English |
|---|---|
| Pages (from-to) | 96-101 |
| Number of pages | 6 |
| Journal | Proceedings of European Design and Test Conference |
| Publication status | Published - Jan 1 1996 |
| Event | Proceedings of the 1996 European Design & Test Conference - Paris, Fr Duration: Mar 11 1996 → Mar 14 1996 |
All Science Journal Classification (ASJC) codes
- Hardware and Architecture
- Electrical and Electronic Engineering