Optimal code placement of embedded software for instruction caches

DOI DOI

Description

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.

Journal

Details 詳細情報について

Report a problem

Back to top