A history-based i-cache for low-energy multimedia applications

Koji Inoue; V. G. Moshnyaga; K. Murakami

doi:10.1109/lpe.2002.146728

A history-based i-cache for low-energy multimedia applications

Koji Inoue, V. G. Moshnyaga, K. Murakami

Research output: Contribution to conference › Paper › peer-review

20 Citations (Scopus)

Abstract

This paper proposes a history-based tag-comparison scheme for reducing energy consumption of direct-mapped instruction caches. The proposed cache efficiently exploits program-execution footprints recorded in the Branch Target Buffer (BTB), and attempts to detect and eliminate unnecessary tag checks at run time. Simulation results show that our approach can eliminate up to 95% of tag checks, saving the cache energy by 17%, while affecting the processor performance by only 0.2%.

Original language	English
Pages	148-153
Number of pages	6
DOIs	https://doi.org/10.1109/lpe.2002.146728
Publication status	Published - 2002
Externally published	Yes
Event	Proceedings of the 2002 International Symposium on Low Power Electronics and Design - Monterey, CA, United States Duration: Aug 12 2002 → Aug 14 2002

Other

Other	Proceedings of the 2002 International Symposium on Low Power Electronics and Design
Country	United States
City	Monterey, CA
Period	8/12/02 → 8/14/02

All Science Journal Classification (ASJC) codes

Engineering(all)

Access to Document

10.1109/lpe.2002.146728

Fingerprint Dive into the research topics of 'A history-based i-cache for low-energy multimedia applications'. Together they form a unique fingerprint.

Cite this

@conference{408d85d1f07f495ebd94961ce04c42c7,

title = "A history-based i-cache for low-energy multimedia applications",

abstract = "This paper proposes a history-based tag-comparison scheme for reducing energy consumption of direct-mapped instruction caches. The proposed cache efficiently exploits program-execution footprints recorded in the Branch Target Buffer (BTB), and attempts to detect and eliminate unnecessary tag checks at run time. Simulation results show that our approach can eliminate up to 95% of tag checks, saving the cache energy by 17%, while affecting the processor performance by only 0.2%.",

author = "Koji Inoue and Moshnyaga, {V. G.} and K. Murakami",

year = "2002",

doi = "10.1109/lpe.2002.146728",

language = "English",

pages = "148--153",

note = "Proceedings of the 2002 International Symposium on Low Power Electronics and Design ; Conference date: 12-08-2002 Through 14-08-2002",

}

TY - CONF

T1 - A history-based i-cache for low-energy multimedia applications

AU - Inoue, Koji

AU - Moshnyaga, V. G.

AU - Murakami, K.

PY - 2002

Y1 - 2002

N2 - This paper proposes a history-based tag-comparison scheme for reducing energy consumption of direct-mapped instruction caches. The proposed cache efficiently exploits program-execution footprints recorded in the Branch Target Buffer (BTB), and attempts to detect and eliminate unnecessary tag checks at run time. Simulation results show that our approach can eliminate up to 95% of tag checks, saving the cache energy by 17%, while affecting the processor performance by only 0.2%.

AB - This paper proposes a history-based tag-comparison scheme for reducing energy consumption of direct-mapped instruction caches. The proposed cache efficiently exploits program-execution footprints recorded in the Branch Target Buffer (BTB), and attempts to detect and eliminate unnecessary tag checks at run time. Simulation results show that our approach can eliminate up to 95% of tag checks, saving the cache energy by 17%, while affecting the processor performance by only 0.2%.

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

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

U2 - 10.1109/lpe.2002.146728

DO - 10.1109/lpe.2002.146728

M3 - Paper

AN - SCOPUS:0036954214

SP - 148

EP - 153

T2 - Proceedings of the 2002 International Symposium on Low Power Electronics and Design

Y2 - 12 August 2002 through 14 August 2002

ER -