【24h】

An energy saving cache algorithm

机译:节能缓存算法

获取原文

摘要

Traditional caches have fixed number of sets. This paper proposes cache architecture with variable number of cache sets. The cache is assumed to be of fixed size. The cache operates assuming one set. On conflict, the number of sets is doubled selectively enabling the cache sets. An algorithm for address mapping is defined. The sets that are unoccupied are put in off mode. The occupied sets operate in high power mode. The proposed model is simulated with SPEC2K benchmark. An energy saving of 10% is observed with improvement in average memory access time by 76% compared with set associative cache of same size.
机译:传统缓存具有固定数量的集合。本文提出了具有可变数量的缓存集的缓存体系结构。假定高速缓存具有固定大小。高速缓存假设一组进行操作。发生冲突时,集的数量会加倍,有选择地启用缓存集。定义了用于地址映射的算法。闲置的电视机处于关闭模式。占用的设备在高功率模式下运行。所提出的模型是使用SPEC2K基准进行仿真的。与设置的相同大小的关联缓存相比,可以节省10%的能源,并且平均内存访问时间可以缩短76%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号