By Topic

A Low-Energy Set-Associative I-Cache Design with Last Accessed Way Based Replacement and Predicting Access Policy

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Li Zhengxing ; Sch. of Comput. Sci. & Eng., Southeast Univ., Nanjing, China ; Yang Quansheng

Predicting access is known as an approach to reduce the set-associative I-cache's energy consumption. This paper proposes a LAW (Last Accessed Way) based low-energy I-cache, taking both the replacement and predicting access policy into account. By replacing and accessing instructions speculatively following the last accessed way, the PHR (predict-hit-rate) is significantly improved. Simulator results show that compared with the conventional LRU (Least Recently Used) replacement based set-associative I-cache, such a 16 KB, 4-way and 32B-line-size I-cache can reduce about 47%~57% energy consumption, with only 2.63% performance overhead. In contrast with the way-prediction cache, the proposed I-cache could improve nearly 5.32% performance overhead and 5.95% energy consumption at little cost of hardware.

Published in:

Information Science and Engineering (ICISE), 2009 1st International Conference on

Date of Conference:

26-28 Dec. 2009