2009 WRI International Conference on Communications and Mobile Computing 2009
DOI: 10.1109/cmc.2009.306
|View full text |Cite
|
Sign up to set email alerts
|

The Design of Way-Prediction Scheme in Set-Associative Cache for Energy Efficient Embedded System

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(3 citation statements)
references
References 7 publications
0
3
0
Order By: Relevance
“…There are two means to further improve the performance of Way-Predicting cache, that's to say, increasing the PHR or reducing the prediction-miss penalties. C. Tseng [6] adopted the MPLRU (Modified Pseudo Least Recently Used) replacement algorithm in Way-Predicting cache to augment the PHR and thus save energy consumption. Valid bits [7] are used in way-predicting caches with sub-block replacement policy, to pre-eliminate those hopeless sub-arrays and thus reduce average energy dissipation.…”
Section: Previous Researchmentioning
confidence: 99%
“…There are two means to further improve the performance of Way-Predicting cache, that's to say, increasing the PHR or reducing the prediction-miss penalties. C. Tseng [6] adopted the MPLRU (Modified Pseudo Least Recently Used) replacement algorithm in Way-Predicting cache to augment the PHR and thus save energy consumption. Valid bits [7] are used in way-predicting caches with sub-block replacement policy, to pre-eliminate those hopeless sub-arrays and thus reduce average energy dissipation.…”
Section: Previous Researchmentioning
confidence: 99%
“…It can also identify dead blocks with 96% accuracy leading to an average L1 improvement of 9% and L2 improvement of 10%. Tseng et al (2009) proposed a method to improve the problems of spatial and temporal locality by using a 2-bit counter to store the most recently used (MRU) information and Modified Pseudo LRU replacement algorithm (MPLRU): 1) To implement MRU, each cache set needs to have 2 bits of index to save the MRU status; and 2) To conduct MPLRU replacement policy, 3 bits are required to hold history information per block for 4-way way-prediction cache. Another method to fix the problems of locality is the use of Dynamic Time Tuning proposed by Zhang et al (2009).…”
Section: Related Workmentioning
confidence: 99%
“…Microarchitectural techniques for saving energy in specific components e.g. main memory ( [82][83][84]), cache [6,16,35,[85][86][87][88][89][90][91][92][93][94][95][96][97][98][99][100][101][102][103], scratchpad memory [104], TLB [105] or making other changes to memory hierarchy e.g. adding extra components [106,107].…”
Section: Overviewmentioning
confidence: 99%