Size-constrained code placement for cache miss rate reduction

Hiroyuki Tomiyama, Hiroto Yasuura

Research output: Contribution to journalArticle

7 Citations (Scopus)

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 [10], 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 proposed in [10] decreases 36% of cache misses with 25% increase in code size.

Original languageEnglish
Pages (from-to)96-101
Number of pages6
JournalProceedings of the International Symposium on System Synthesis
Publication statusPublished - 1996

Fingerprint

Embedded systems
Electric power utilization

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture

Cite this

Size-constrained code placement for cache miss rate reduction. / Tomiyama, Hiroyuki; Yasuura, Hiroto.

In: Proceedings of the International Symposium on System Synthesis, 1996, p. 96-101.

Research output: Contribution to journalArticle

@article{bb826dbb4159448ea31bd897c46e265f,
title = "Size-constrained code placement for cache miss rate reduction",
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 [10], 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 proposed in [10] decreases 36{\%} of cache misses with 25{\%} increase in code size.",
author = "Hiroyuki Tomiyama and Hiroto Yasuura",
year = "1996",
language = "English",
pages = "96--101",
journal = "Proceedings of the International Symposium on System Synthesis",
issn = "1080-1820",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Size-constrained code placement for cache miss rate reduction

AU - Tomiyama, Hiroyuki

AU - Yasuura, Hiroto

PY - 1996

Y1 - 1996

N2 - 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 [10], 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 proposed in [10] decreases 36% of cache misses with 25% increase in code size.

AB - 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 [10], 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 proposed in [10] decreases 36% of cache misses with 25% increase in code size.

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

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

M3 - Article

SP - 96

EP - 101

JO - Proceedings of the International Symposium on System Synthesis

JF - Proceedings of the International Symposium on System Synthesis

SN - 1080-1820

ER -