DocumentCode
3451007
Title
Size-constrained code placement for cache miss rate reduction
Author
Tomiyama, Hiroyuki ; Yasuura, Hiroto
Author_Institution
Dept. of Comput. Sci. & Commun. Eng., Kyushu Univ., Fukuoka, Japan
fYear
1996
fDate
6-8 Nov 1996
Firstpage
96
Lastpage
101
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 (1996), 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 decreases 36% of cache misses with 25% increase in code size
Keywords
cache storage; performance evaluation; real-time systems; storage management; cache miss rate reduction; code placement; code placement method; embedded system; instruction caches; power consumption; size-constrained; Computer science; Embedded software; Embedded system; Energy consumption; Flow graphs; Information science; Power engineering and energy; Software design; System performance; Weight control;
fLanguage
English
Publisher
ieee
Conference_Titel
System Synthesis, 1996. Proceedings., 9th International Symposium on
Conference_Location
La Jolla, CA
ISSN
1080-1820
Print_ISBN
0-8186-7563-2
Type
conf
DOI
10.1109/ISSS.1996.565887
Filename
565887
Link To Document