发明申请
US20130151777A1 Dynamic Inclusive Policy in a Hybrid Cache Hierarchy Using Hit Rate
失效
使用命中率的混合缓存层次结构中的动态包容性策略
- 专利标题： Dynamic Inclusive Policy in a Hybrid Cache Hierarchy Using Hit Rate
- 专利标题（中）： 使用命中率的混合缓存层次结构中的动态包容性策略
-
申请号： US13315381申请日： 2011-12-09
-
公开(公告)号： US20130151777A1公开(公告)日： 2013-06-13
- 发明人: David M. Daly , Benjiman L. Goodman , Stephen J. Powell , Aaron C. Sawdey , Jeffrey A. Stuecheli
- 申请人： David M. Daly , Benjiman L. Goodman , Stephen J. Powell , Aaron C. Sawdey , Jeffrey A. Stuecheli
- 申请人地址： US NY Armonk
- 专利权人： International Business Machines Corporation
- 当前专利权人： International Business Machines Corporation
- 当前专利权人地址： US NY Armonk
- 主分类号： G06F12/08
- IPC分类号： G06F12/08
摘要：
A mechanism is provided for dynamic cache allocation using a cache hit rate. A first cache hit rate is monitored in a first subset utilizing a first allocation policy of N sets of a lower level cache. A second cache hit rate is also monitored in a second subset utilizing a second allocation policy different from the first allocation policy of the N sets of the lower level cache. A periodic comparison of the first cache hit rate to the second cache hit rate is made to identify a third allocation policy for a third subset of the N-sets of the lower level cache. The third allocation policy for the third subset is then periodically adjusted to at least one of the first allocation policy or the second allocation policy based on the comparison of the first cache hit rate to the second cache hit rate.