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

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

机译:高速缓存分配机制,通过替代受害和替代牺牲成员的估算老有所节省当选不配成员

摘要

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

著录项

  • 公开/公告号US6993628B2

    专利类型

  • 公开/公告日2006-01-31

    原文格式PDF

  • 申请/专利权人 WILLIAM JOHN STARKE;

    申请/专利号US20030425442

  • 发明设计人 WILLIAM JOHN STARKE;

    申请日2003-04-28

  • 分类号G06F12/12;

  • 国家 US

  • 入库时间 2022-08-21 21:40:56

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号