首页> 外国专利> Cache allocation mechanism for saving multiple elected unworthy members via substitute victimization and imputed worthiness of multiple substitute victim members

Cache allocation mechanism for saving multiple elected unworthy members via substitute victimization and imputed worthiness of multiple substitute victim members

机译:高速缓存分配机制,通过替代受害和多个替代牺牲品成员估算老有所为保存多个当选不配成员

摘要

A method and apparatus in a data processing system for protecting against displacement of two types of cache lines using a least recently used cache management process. A first member in a class of cache lines is selected as a first substitute victim. The first substitute victim is unselectable by the least recently used cache management process, and the second substitute victim is associated with a selected member in the class of cache lines. A second member in the class of cache lines is selected as a second substitute victim. The second victim is unselectable by the least recently used cache management process, and the second substitute victim is associated with the selected member in the class of cache lines. One of the first or second substitute victims are replaced in response to a selection of the selected member as a victim when a cache miss occurs, wherein the selected member remains in the class of cache lines.
机译:数据处理系统中的一种方法和装置,用于使用最近最少使用的高速缓存管理过程来防止两种类型的高速缓存行的移位。选择一类高速缓存行中的第一成员作为第一替代受害者。第一替代受害者无法通过最近最少使用的缓存管理过程来选择,第二替代受害者与高速缓存行类别中的选定成员相关联。选择高速缓存行类别中的第二个成员作为第二个替代受害者。第二牺牲者无法通过最近最少使用的缓存管理过程选择,并且第二替代牺牲者与缓存行类别中的选定成员相关联。当发生高速缓存未命中时,响应于选择所选成员作为受害者,替换第一或第二替代受害者中的一个,其中所选成员保持在高速缓存行的类别中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号