会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 84. 发明申请
    • Information Handling System with Immediate Scheduling of Load Operations and Fine-Grained Access to Cache Memory
    • 信息处理系统,即时调度负载操作和细粒度访问高速缓存
    • US20100268883A1
    • 2010-10-21
    • US12424332
    • 2009-04-15
    • Sanjeev GhaiGuy Lynn GuthrieStephen PowellWilliam John Starke
    • Sanjeev GhaiGuy Lynn GuthrieStephen PowellWilliam John Starke
    • G06F12/08G06F12/00
    • G06F12/0822
    • An information handling system (IHS) includes a processor with a cache memory system. The processor includes a processor core with an L1 cache memory that couples to an L2 cache memory. The processor includes an arbitration mechanism that controls load and store requests to the L2 cache memory. The arbitration mechanism includes control logic that enables a load request to interrupt a store request that the L2 cache memory is currently servicing. When the L2 cache memory finishes servicing the interrupting load request, the L2 cache memory may return to servicing the interrupted store request at the point of interruption. The control logic determines the size requirement of each load operation or store operation. When the cache memory system performs a store operation or load operation, the memory system accesses the portion of a cache line it needs to perform the operation instead of accessing an entire cache line.
    • 信息处理系统(IHS)包括具有高速缓冲存储器系统的处理器。 处理器包括具有耦合到L2高速缓冲存储器的L1高速缓冲存储器的处理器核心。 处理器包括仲裁机制,其控制对L2高速缓冲存储器的加载和存储请求。 仲裁机制包括控制逻辑,其允许加载请求中断L2高速缓冲存储器当前正在服务的存储请求。 当L2高速缓存存储器完成对中断加载请求的服务时,L2高速缓冲存储器可以在中断点返回服务中断的存储请求。 控制逻辑确定每个加载操作或存储操作的大小要求。 当高速缓冲存储器系统执行存储操作或加载操作时,存储器系统访问它需要执行操作的高速缓存行的部分,而不是访问整个高速缓存行。
    • 85. 发明授权
    • 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受害者选择的情况下,否定受保护成员的选择。
    • 89. 发明申请
    • CACHE MEMBER PROTECTION WITH PARTIAL MAKE MRU ALLOCATION
    • 缓存成员保护,部分成为MRU分配
    • US20080177953A1
    • 2008-07-24
    • US11951770
    • 2007-12-06
    • ROBERT H. BELLGuy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • ROBERT H. BELLGuy Lynn GuthrieWilliam John StarkeJeffrey Adam Stuecheli
    • G06F12/12
    • 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受害者选择的情况下否定对被保护成员的选择。