电子学报 ›› 2013, Vol. 41 ›› Issue (4): 681-684.DOI: 10.3969/j.issn.0372-2112.2013.04.009

• 学术论文 • 上一篇    下一篇

一种基于伪LRU的新型共享Cache划分机制

倪亚路, 周晓方   

  1. 复旦大学专用集成电路与系统国家重点实验室,上海 201203
  • 收稿日期:2012-05-02 修回日期:2012-11-06 出版日期:2013-04-25
    • 作者简介:
    • 倪亚路 男,1987年生于天津,硕士研究生,主要研究方向为专用集成电路设计. 周晓方 男,1970年生于上海,1988年复旦大学理学博士毕业,现任教于复旦大学微电子学系,高级工程师、硕士生导师.研究方向:嵌入式处理器架构和可重构数字信号处理,数字集成电路SoC设计. E-mail:xiaofangzhou@fudan.edu.cn
    • 基金资助:
    • 国家自然科学基金 (No.60876016)

A Novel Pseudo-LRU Based Shared Cache Partitioning Mechanism

NI Ya-lu, ZHOU Xiao-fang   

  1. ASIC & Systems State Key Laboratory, Fudan University, Shanghai 201203, China
  • Received:2012-05-02 Revised:2012-11-06 Online:2013-04-25 Published:2013-04-25
    • Supported by:
    • National Natural Science Foundation of China (No.60876016)

摘要: 本文提出了一种基于伪LRU方法的新型共享Cache动态划分策略PLRU-SCP.本文提出的划分策略在分析电路中给出了基于二叉树的新型分析方法,在划分电路中使用了一种非遍历的划分算法.并提出了一种新型共享Cache结构.本文提出的新型划分策略比基于LRU方法的不划分共享Cache策略和效用最优的划分策略的性能分别提高了11.05%和8.66%.

关键词: 共享Cache, 伪LRU替换方法, 二叉树分析, 非遍历划分算法

Abstract: A novel dynamic cache partitioning strategy based on pseudo-LRU policies(PLRU-SCP)is proposed in this paper.The analysis circuit for the proposed strategy makes use of a new statistical method based on binary tree,and the partitioning circuit employs the non-exhaustive algorithm.Besides,we presents a novel shared cache structure.According to simulation results,the proposed shared cache with PLRU-SCP outperforms those without the partitioning strategy using LRU policy(LRU-NP)by 11.05% on average performance,and has a better performance than those with the utility-based partitioning strategy using LRU method(LRU-UCP)by 8.66%.

Key words: shared cache, pseudo-LRU policy, binary tree analysis, non-exhaustive partitioning algorithm

中图分类号: