会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Cache mechanism and method for avoiding cast out on bad victim select and recycling victim select operation
    • 缓存机制和方法,用于避免对不良受害者选择和回收受害者选择操作
    • US07987320B2
    • 2011-07-26
    • US11951783
    • 2007-12-06
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John Starke
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John Starke
    • G06F12/00
    • G06F12/126G06F12/125G06F2212/1032
    • A method, apparatus, and computer for identifying selection of a bad victim during victim selection at a cache and recovering from such bad victim selection without causing the system to crash or suspend forward progress of the victim selection process. Among the bad victim selection addressed are recovery from selection of a deleted member and recovery from use of LRU state bits that do not map to a member within the congruence class. When LRU victim selection logic generates an output vector identifying a victim, the output vector is checked to ensure that it is a valid vector (non-null) and that it is not pointing to a deleted member. When the output vector is not valid or points to a deleted member, the LRU victim selection logic is triggered to re-start the victim selection process.
    • 一种方法,装置和计算机,用于在高速缓存的受害者选择期间识别对不良受害者的选择,并从这种不良受害者选择中恢复,而不会导致系统崩溃或中止向前进行受害者选择过程。 所解决的不良受害者选择之一是从选择已删除成员的恢复以及使用不映射到同余类中的成员的LRU状态位进行恢复。 当LRU受害者选择逻辑生成识别受害者的输出向量时,检查输出向量以确保它是有效向量(非空值),并且不指向已删除的成员。 当输出向量无效或指向被删除成员时,LRU受害者选择逻辑被触发以重新启动受害者选择过程。
    • 2. 发明授权
    • Cache mechanism and method for avoiding cast out on bad victim select and recycling victim select operation
    • 缓存机制和方法,用于避免对不良受害者选择和回收受害者选择操作
    • US07343455B2
    • 2008-03-11
    • US11054394
    • 2005-02-09
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John Starke
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John Starke
    • G06F12/00
    • G06F12/126G06F12/123G06F2212/1032
    • A method, apparatus, and computer for identifying selection of a bad victim during victim selection at a cache and recovering from such bad victim selection without causing the system to crash or suspend forward progress of the victim selection process. Among the bad victim selection addressed are recovery from selection of a deleted member and recovery from use of LRU state bits that do not map to a member within the congruence class. When LRU victim selection logic generates an output vector identifying a victim, the output vector is checked to ensure that it is a valid vector (non-null) and that it is not pointing to a deleted member. When the output vector is not valid or points to a deleted member, the LRU victim selection logic is triggered to re-start the victim selection process.
    • 一种方法,装置和计算机,用于在高速缓存的受害者选择期间识别对不良受害者的选择,并从这种不良受害者选择中恢复,而不会导致系统崩溃或中止向前进行受害者选择过程。 所解决的不良受害者选择之一是从选择已删除成员的恢复以及使用不映射到同余类中的成员的LRU状态位进行恢复。 当LRU受害者选择逻辑生成识别受害者的输出向量时,检查输出向量以确保它是有效向量(非空值),并且不指向已删除的成员。 当输出向量无效或指向被删除成员时,LRU受害者选择逻辑被触发以重新启动受害者选择过程。
    • 3. 发明授权
    • Cache member protection with partial make MRU allocation
    • 缓存成员保护部分使MRU分配
    • US07689777B2
    • 2010-03-30
    • US11951770
    • 2007-12-06
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • G06F12/00
    • G06F12/126G06F12/0897G06F12/123G06F12/128
    • A method and apparatus for enabling protection of a particular member of a cache during LRU victim selection. LRU state array includes additional “protection” bits in addition to the state bits. The protection bits serve as a pointer to identify the location of the member of the congruence class that is to be protected. A protected member is not removed from the cache during standard LRU victim selection, unless that member is invalid. The protection bits are pipelined to MRU update logic, where they are used to generate an MRU vector. The particular member identified by the MRU vector (and pointer) is protected from selection as the next LRU victim, unless the member is Invalid. The make MRU operation affects only the lower level LRU state bits arranged a tree-based structure and thus only negates the selection of the protected member, without affecting LRU victim selection of the other members.
    • 一种用于在LRU受害者选择期间能够保护缓存的特定成员的方法和装置。 LRU状态阵列除了状态位之外还包括额外的“保护”位。 保护位用作用于标识要保护的同余类的成员的位置的指针。 在标准LRU受害者选择期间,保护成员不会从缓存中删除,除非该成员无效。 保护位被流水线到MRU更新逻辑,它们用于生成MRU向量。 由MRU向量(和指针)标识的特定成员不被选择作为下一个LRU受害者,除非成员无效。 使MRU操作仅影响布置了基于树的结构的较低级LRU状态位,并且因此仅在不影响其他成员的LRU受害者选择的情况下,否定受保护成员的选择。
    • 6. 发明授权
    • Cache member protection with partial make MRU allocation
    • 缓存成员保护部分使MRU分配
    • US07363433B2
    • 2008-04-22
    • US11054390
    • 2005-02-09
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • Robert H. Bell, Jr.Guy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • G06F12/00
    • G06F12/126G06F12/0897G06F12/123G06F12/128
    • A method and apparatus for enabling protection of a particular member of a cache during LRU victim selection. LRU state array includes additional “protection” bits in addition to the state bits. The protection bits serve as a pointer to identify the location of the member of the congruence class that is to be protected. A protected member is not removed from the cache during standard LRU victim selection, unless that member is invalid. The protection bits are pipelined to MRU update logic, where they are used to generate an MRU vector. The particular member identified by the MRU vector (and pointer) is protected from selection as the next LRU victim, unless the member is Invalid. The make MRU operation affects only the lower level LRU state bits arranged a tree-based structure and thus only negates the selection of the protected member, without affecting LRU victim selection of the other members.
    • 一种用于在LRU受害者选择期间能够保护缓存的特定成员的方法和装置。 LRU状态阵列除了状态位之外还包括额外的“保护”位。 保护位用作用于标识要保护的同余类的成员的位置的指针。 在标准LRU受害者选择期间,保护成员不会从缓存中删除,除非该成员无效。 保护位被流水线到MRU更新逻辑,它们用于生成MRU向量。 由MRU向量(和指针)标识的特定成员不被选择作为下一个LRU受害者,除非成员无效。 使MRU操作仅影响布置了基于树的结构的较低级LRU状态位,并且因此仅在不影响其他成员的LRU受害者选择的情况下,否定受保护成员的选择。