首页> 外文期刊>SIAM journal on applied dynamical systems >LER: Least-Error-Rate Replacement Algorithm for Emerging STT-RAM Caches
【24h】

LER: Least-Error-Rate Replacement Algorithm for Emerging STT-RAM Caches

机译:LER:最小差错率替换算法用于新兴STT-RAM缓存

获取原文
获取原文并翻译 | 示例
           

摘要

Spin-transfer-torque RAMs (STT-RAMs) are the most promising technology for replacing Static RAMs (SRAMs) in on-chip caches. One of the major problems in STT-RAMs is the high error rate due to stochastic switching in WRITE operations. Cache replacement algorithms have a major role in the number of WRITE operations into the caches. Due to this fact, it is necessary to redesign cache replacement algorithms to consider the new challenges of STT-RAM caches. This paper proposes a cache replacement algorithm, which is called least error rate (LER), to reduce the error rate in L2 caches. The main idea is to place the incoming block in a line that incurs the minimum error rate in WRITE operation. This is done by comparing the contents of the incoming block with lines in a cache set. Compared with Least Recently Used (LRU) algorithm, LER reduces the error rate by 2x with about 1.4% and 3.6% performance and dynamic energy consumption overheads, respectively. Moreover, LER imposes no area overhead to system.
机译:旋转传输 - 扭矩柱塞(STT-RAM)是更换片上缓存中的静态RAM(SRAM)的最有前途的技术。 STT-RAM中的一个主要问题是由于写入操作中的随机切换导致的高误差率。缓存替换算法在将写入操作的数量中具有重要作用,进入缓存中的写入操作。由于这一事实,有必要重新设计缓存替换算法,以考虑STT-RAM缓存的新挑战。本文提出了一种缓存替换算法,该算法被称为最低错误率(LER),以降低L2缓存中的错误率。主要思想是将传入的块放在一个在写操作中引起最小错误率的行中。这是通过将传入块的内容与缓存集中的行进行比较来完成的。与最近使用的(LRU)算法相比,LER分别将误差率降低2倍,分别具有约1.4%和3.6%的性能和动态能耗开销。此外,Ler对系统施加了任何区域开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号