会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Intelligent cache management mechanism via processor access sequence analysis
    • 智能缓存管理机制通过处理器访问序列分析
    • US06629210B1
    • 2003-09-30
    • US09696888
    • 2000-10-26
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • G06F1208
    • G06F12/121G06F12/0815
    • In addition to an address tag, a coherency state and an LRU position, each cache directory entry includes historical processor access information for the corresponding cache line. The historical processor access information includes different subentries for each different processor which has accessed the corresponding cache line, with subentries being “pushed” along the stack when a new processor accesses the subject cache line. Each subentries contains the processor identifier for the corresponding processor which accessed the cache line, one or more opcodes identifying the operations which were performed by the processor, and timestamps associated with each opcode. This historical processor access information may then be utilized by the cache controller to influence victim selection, coherency state transitions, LRU state transitions, deallocation timing, and other cache management functions so that smaller caches are given the effectiveness of very large caches through more intelligent cache management.
    • 除了地址标签,一致性状态和LRU位置之外,每个高速缓存目录条目包括对应的高速缓存行的历史处理器访问信息。 历史处理器访问信息包括已经访问相应的高速缓存行的每个不同处理器的不同子条目,当新处理器访问对象高速缓存行时,子条目沿“栈”被“推送”。 每个子条目包含访问高速缓存行的相应处理器的处理器标识符,标识由处理器执行的操作的一个或多个操作码以及与每个操作码相关联的时间戳。 然后,该历史处理器访问信息可以由高速缓存控制器利用来影响受害者选择,一致性状态转换,LRU状态转换,解除分配定时和其他高速缓存管理功能,使得通过更智能高速缓存向更小的高速缓存提供非常大的高速缓存的有效性 管理。
    • 4. 发明授权
    • High performance cache intervention mechanism for symmetric multiprocessor systems
    • 对称多处理器系统的高性能缓存干预机制
    • US06763433B1
    • 2004-07-13
    • US09696910
    • 2000-10-26
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • G06F1208
    • G06F12/0831G06F12/0888
    • Upon snooping an operation in which an intervention is permitted or required, an intervening cache may elect to source only that portion of a requested cache line which is actually required, rather than the entire cache line. For example, if the intervening cache determines that the requesting cache would likely be required to invalidate the cache line soon after receipt, less than the full cache line may be sourced to the requesting cache. The requesting cache will not cache less than a full cache line, but may forward the received data to the processor supported by the requesting cache. Data bus bandwidth utilization may therefore be reduced. Additionally, the need to subsequently invalidate the cache line within the requesting cache is avoided, together with the possibility that the requesting cache will retry an operation requiring invalidation of the cache line.
    • 在窥探允许或需要干预的操作时,中间缓存可以选择仅仅提供实际需要的所请求的高速缓存行的那部分,而不是整个高速缓存行。 例如,如果中间缓存确定可能需要请求的高速缓存在接收之后不久使高速缓存行无效,则小于全缓存行可以被提供给请求的高速缓存。 请求的高速缓存不会缓存小于完整的高速缓存行,而是可以将接收到的数据转发到由请求的高速缓存支持的处理器。 因此可以减少数据总线带宽利用率。 此外,避免了随后使请求高速缓存中的高速缓存行无效的需要,以及请求高速缓存将重试需要高速缓存行无效的操作的可能性。
    • 5. 发明授权
    • Enhanced cache management mechanism via an intelligent system bus monitor
    • 通过智能系统总线监视器增强缓存管理机制
    • US06721856B1
    • 2004-04-13
    • US09696887
    • 2000-10-26
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • G06F1200
    • G06F12/0831
    • In addition to an address tag, a coherency state and an LRU position, each cache directory entry includes historical processor access, snoop operation, and system controller hint information for the corresponding cache line. Each entry includes different subentries for different processors which have accessed the corresponding cache line, with subentries containing a processor access sequence segment, a snoop operation sequence segment, and a system controller hint history segment. In addition to an address tag, within each system controller bus transaction sequence log directory entry is contained one or more opcodes identifying bus operations addressing the corresponding cache line, a processor identifier associated with each opcode, and a timestamp associated with each opcode. Also, along with each system bus transaction's opcode, the individual snoop responses that were received from one or more snoopers and the hint information that was provided to the requester and the snoopers may also be included. This information may then be utilized by the system controller to append hints to the combined snoop responses in order to influence cache controllers (the requestor(s), snoopers, or both) handling of victim selection, coherency state transitions, LRU state transitions, deallocation timing, and other cache management functions.
    • 除了地址标签,一致性状态和LRU位置之外,每个缓存目录条目包括对应的高速缓存行的历史处理器访问,窥探操作和系统控制器提示信息。 每个条目包括不同处理器的不同子条目,这些子进程已访问相应的高速缓存行,子条目包含处理器访问序列段,侦听操作序列段和系统控制器提示历史段。 除了地址标签之外,在每个系统控制器总线事务序列日志目录条目中还包含一个或多个操作码,用于标识寻址相应高速缓存行的总线操作,与每个操作码相关联的处理器标识符以及与每个操作码相关联的时间戳。 此外,连同每个系统总线事务的操作码,也可以包括从一个或多个窥探者接收到的各个窥探响应以及提供给请求者和窥探者的提示信息。 该信息随后可被系统控制器利用来附加到组合侦听响应的提示,以便影响高层控制器(请求者,窥探者或两者)处理受害者选择,相关性状态转换,LRU状态转换,释放 定时和其他缓存管理功能。
    • 6. 发明授权
    • Dynamic cache management in a symmetric multiprocessor system via snoop operation sequence analysis
    • 通过snoop操作序列分析在对称多处理器系统中进行动态缓存管理
    • US06601144B1
    • 2003-07-29
    • US09696912
    • 2000-10-26
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • Ravi K. ArimilliJohn Steven DodsonJames Stephen Fields, Jr.Guy Lynn Guthrie
    • G06F1208
    • G06F12/0831G06F12/121G06F12/123
    • In addition to an address tag, a coherency state and an LRU position, each cache directory entry includes historical processor access and snoop operation information for the corresponding cache line. The historical processor access and snoop operation information includes different subentries for each different processor which has accessed the corresponding cache line, with subentries being “pushed” along the stack when a new processor accesses the subject cache line. Each subentries contains the processor identifier for the corresponding-processor which accessed the cache line, a processor access history segment, and a snoop operation history segment. The processor access history segment contains one or more opcodes identifying the operations which were performed by the processor, and timestamps associated with each opcode. The snoop operation history segment contains, for each operation snooped by the respective processor, a processor identifier for the processor originating the snooped operation, an opcode identifying the snooped operation, and a timestamp identifying when the operation was snooped. This historical processor access and snoop operation information may then be utilized by the cache controller to influence victim selection, coherency state transitions, LRU state transitions, deallocation timing, and other cache management functions so that smaller caches are given the effectiveness of very large caches through more intelligent cache management.
    • 除了地址标签,一致性状态和LRU位置之外,每个高速缓存目录条目包括对应的高速缓存行的历史处理器访问和窥探操作信息。 历史处理器访问和窥探操作信息包括已经访问相应的高速缓存行的每个不同处理器的不同子条目,当新的处理器访问对象高速缓存行时,子进程沿堆栈被“推送”。 每个子条目包含访问高速缓存线的对应处理器的处理器标识符,处理器访问历史段和窥探操作历史段。 处理器访问历史段包含标识由处理器执行的操作的一个或多个操作码以及与每个操作码相关联的时间戳。 对于由相应处理器窥探的每个操作,窥探操作历史段包含用于发起被窥探操作的处理器的处理器标识符,识别被窥探操作的操作码,以及标识该操作何时被窥探的时间戳。 然后,该历史处理器访问和窥探操作信息可被高速缓存控制器用于影响受害者选择,一致性状态转换,LRU状态转换,释放定时和其他高速缓存管理功能,使得较小的高速缓存被给予非常大的缓存的有效性 更智能的缓存管理。
    • 7. 发明授权
    • Optimized cache allocation algorithm for multiple speculative requests
    • 针对多个推测请求的优化缓存分配算法
    • US06393528B1
    • 2002-05-21
    • US09345714
    • 1999-06-30
    • Ravi Kumar ArimilliLakshminarayana Baba ArimilliLeo James ClarkJohn Steven DodsonGuy Lynn GuthrieJames Stephen Fields, Jr.
    • Ravi Kumar ArimilliLakshminarayana Baba ArimilliLeo James ClarkJohn Steven DodsonGuy Lynn GuthrieJames Stephen Fields, Jr.
    • G06F1200
    • G06F12/0862G06F12/127
    • A method of operating a computer system is disclosed in which an instruction having an explicit prefetch request is issued directly from an instruction sequence unit to a prefetch unit of a processing unit. In a preferred embodiment, two prefetch units are used, the first prefetch unit being hardware independent and dynamically monitoring one or more active streams associated with operations carried out by a core of the processing unit, and the second prefetch unit being aware of the lower level storage subsystem and sending with the prefetch request an indication that a prefetch value is to be loaded into a lower level cache of the processing unit. The invention may advantageously associate each prefetch request with a stream ID of an associated processor stream, or a processor ID of the requesting processing unit (the latter feature is particularly useful for caches which are shared by a processing unit cluster). If another prefetch value is requested from the memory hiearchy and it is determined that a prefetch limit of cache usage has been met by the cache, then a cache line in the cache containing one of the earlier prefetch values is allocated for receiving the other prefetch value.
    • 公开了一种操作计算机系统的方法,其中具有显式预取请求的指令直接从指令序列单元发送到处理单元的预取单元。 在优选实施例中,使用两个预取单元,第一预取单元是硬件独立的,并且动态地监视与由处理单元的核心执行的操作相关联的一个或多个活动流,并且第二预取单元知道较低级别 存储子系统,并用预取请求发送将预取值加载到处理单元的较低级缓存中的指示。 本发明可以有利地将每个预取请求与相关联的处理器流的流ID或请求处理单元的处理器ID相关联(后一特征对于由处理单元簇共享的高速缓存特别有用)。 如果从存储器hiearchy请求另一个预取值,并且确定高速缓存的高速缓存使用的预取限制已被满足,则包含先前预取值中的一个的高速缓存行中的高速缓存行被分配用于接收另一个预取值 。