arrow
返回

Cache replacement algorithms with nonuniform miss costs

delete2006-04-01
delete34
PRE
AI
J
Jeong, JH
M
Michel Dubois
DOI:10.1109/TC.2006.50delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Cache replacement algorithms originally developed in the context of uniprocessors executing one instruction at a time implicitly assume that all cache misses have the same cost. However, in modern systems, some cache misses are more expensive than others. The cost may be latency, penalty, power consumption, bandwidth consumption, or any other ad hoc numerical property attached to a miss. We call the class of replacement algorithms designed to minimize a nonuniform miss cost function cost-sensitive replacement algorithms. In this paper, we first introduce and analyze an optimum cost-sensitive replacement algorithm ( CSOPT) in the context of multiple nonuniform miss costs. CSOPT can significantly improve the cost function over OPT ( the replacement algorithm minimizing miss count) in large regions of the design space. Although CSOPT is an offline and unrealizable replacement policy, it serves as a lower bound on the achievable cost by realistic cost-sensitive replacement algorithms. Using the practical example of latency cost in CC-NUMA multiprocessors, we demonstrate that there is a lot of room left to improve current replacement algorithms in many situations beyond the promise of OPT. Next, we introduce three practical extensions of LRU inspired by CSOPT and we compare their performance to LRU, OPT, and CSOPT. Finally, as a practical application, we evaluate these realizable cost-sensitive replacement algorithms in the context of the second-level caches of a CC-NUMA multiprocessor with superscalar processors, using the miss latency as the cost function. By applying simple replacement policies sensitive to the latency of misses, we can improve the execution time of some parallel applications by up to 18 percent.
Keyword:
cache
latency
memory system
power
replacement policy
trace-driven simulations

期刊

IEEE Transactions on Computers 封面图
IEEE Transactions on Computers
IF:
3.8
论文数:
5.3K
被引数:
9.8K

机构

暂无机构信息
引用论文

引用论文

First Capture of Antiprotons in a Penning Trap: A Kiloelectronvolt Source
err1986-11-17
err0
errOAAI
errG. Gabrielse; X. Fei; K. Helmerson; S. L. Rolston; R. Tjoelker; T. A. Trainor; H. Kalinowsky; J. Haas; W. Kells
err分享
err收藏
Training Perceptual Skill by Orienting Visual Attention
err2006-06-01
err0
errOAAI
errNorbert Hagemann; Bernd Strauss; Rouwen Cañal-Bruland
err分享
err收藏
Auditory development in the absence of hearing in infancy
err2010-02-17
err0
PREAI
errKaren Ann Gordon; Jerome Valero; Stephanie F. Jewell; Julia Ahn; Blake C. Papsin
err分享
err收藏
没有更多内容