説明
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.
収録刊行物
-
- Proceedings ED&TC European Design and Test Conference
-
Proceedings ED&TC European Design and Test Conference 96-101, 2002-12-23
IEEE Comput. Soc. Press
