Optimal code placement of embedded software for instruction caches

Hiroyuki Tomiyama, Hiroto Yasuura

Research output: Contribution to journalArticle

23 Citations (Scopus)

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 languageEnglish
Pages (from-to)96-101
Number of pages6
JournalProceedings of European Design and Test Conference
Publication statusPublished - 1996

Fingerprint

Embedded software
Linear programming

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Electrical and Electronic Engineering

Cite this

Optimal code placement of embedded software for instruction caches. / Tomiyama, Hiroyuki; Yasuura, Hiroto.

In: Proceedings of European Design and Test Conference, 1996, p. 96-101.

Research output: Contribution to journalArticle

@article{b34b62e14a584e138559c24b3211dfed,
title = "Optimal code placement of embedded software for instruction caches",
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.",
author = "Hiroyuki Tomiyama and Hiroto Yasuura",
year = "1996",
language = "English",
pages = "96--101",
journal = "Proceedings of European Design and Test Conference",
issn = "1066-1409",

}

TY - JOUR

T1 - Optimal code placement of embedded software for instruction caches

AU - Tomiyama, Hiroyuki

AU - Yasuura, Hiroto

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029734564&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029734564&partnerID=8YFLogxK

M3 - Article

SP - 96

EP - 101

JO - Proceedings of European Design and Test Conference

JF - Proceedings of European Design and Test Conference

SN - 1066-1409

ER -