首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >Dynamic Associativity Management in Tiled CMPs by Runtime Adaptation of Fellow Sets
【24h】

Dynamic Associativity Management in Tiled CMPs by Runtime Adaptation of Fellow Sets

机译:通过同伴集的运行时适应在平铺CMP中进行动态关联管理

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

The non-uniform distribution of memory accesses among the cache sets results in some sets being used heavily while certain others remaining underutilized. Dynamic associativity management (DAM) is a technique to allow the heavily used sets to distribute their load among the lightly used sets thus improving the overall utilization of the cache. CMP-SVR is a previously proposed DAM based technique, where each set is divided into two sections: normal storage (NT) and reserve storage (RT). Some number of ways (25 to 50 percent) from each set are reserved for RT and the remaining ways belong to NT. The sets are divided into groups called fellow-groups and a set can use the reserve-ways of its fellow sets to increase its associativity during execution. Though CMP-SVR improves performance the formation of its fellow-groups is static: once created it never changes. It has been observed that some fellow-groups have more number of heavily used sets than the other fellow-groups. As a result the cache loads are not uniformly distributed among the fellow-groups. Also the behavior of sets changes dynamically: a lightly used set may become heavily used after a number of execution cycles. This paper studies the behavior of each set in detail and proposes a DAM based technique which improves the performance compared to other DAM based techniques. The proposed technique called FS-DAM dynamically creates fellow-groups based on the current set loads ensuring that the heavily used sets are evenly distributed among all the fellow-groups. Such distribution increases the utilization of the cache and hence improves performance. Full system simulation shows an average of 6.62 and 16.74 percent improvements, in FS-DAM as compared to CMP-SVR, in terms of CPI (Cycles Per Instruction) and MPKI (Miss Per Thousand Instructions) respectively. Comparing with Z-Cache the improvements are 6.21 percent (CPI) and 14.65 percent (MPKI). The proposed policy also shows better performance over V-Way and SBC.
机译:高速缓存集之间内存访问的不均匀分布导致某些集被大量使用,而另一些集则未被充分利用。动态关联性管理(DAM)是一种允许频繁使用的集合在轻度使用的集合之间分配其负载的技术,从而提高了缓存的整体利用率。 CMP-SVR是先前提出的基于DAM的技术,其中每组都分为两个部分:普通存储(NT)和备用存储(RT)。每组中的某些方式(25%到50%)保留给RT,其余方式属于NT。这些集合被分为称为同伴群组的组,并且一个集合可以使用其同伴集合的保留方式来提高执行期间的关联性。尽管CMP-SVR可以提高性能,但其同伴的形成是静态的:一旦创建,它就不会改变。据观察,一些同伴组比其他同伴组拥有更多的频繁使用集。结果,缓存负载没有在同伴组之间均匀分布。集合的行为也会动态更改:使用很少的集合在执行多个周期后可能会变得大量使用。本文详细研究了每个集合的行为,并提出了一种基于DAM的技术,与其他基于DAM的技术相比,该技术可以提高性能。所提出的称为FS-DAM的技术会根据当前的集合负载动态创建伙伴组,从而确保将使用频繁的集合均匀地分布在所有伙伴组中。这种分布增加了缓存的利用率,因此提高了性能。完整的系统仿真显示,与CPI-SVR相比,FS-DAM的CPI(每条指令的周期数)和MPKI(每千条指令的小姐数)分别平均提高了6.62%和16.74%。与Z-Cache相比,改进为6.21%(CPI)和14.65%(MPKI)。与V-Way和SBC相比,建议的策略还显示出更好的性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号