会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 63. 发明授权
    • Range check based lookup tables
    • 基于范围检查的查找表
    • US08914431B2
    • 2014-12-16
    • US13342232
    • 2012-01-03
    • Steven R. CarloughKlaus M. KroenerChristophe J. LayerSilvia Melitta MuellerKerstin Schelm
    • Steven R. CarloughKlaus M. KroenerChristophe J. LayerSilvia Melitta MuellerKerstin Schelm
    • G06F7/38
    • G06F7/5375G06F2207/5354
    • Mechanisms for utilizing a reduced lookup table circuit to perform an operation in a data processing device are provided. A first input value is input for selecting a subset of values from the reduced lookup table circuit. The reduced lookup table circuit stores only boundary cell values from a fully filled lookup table corresponding to the reduced lookup table circuit. The subset of values comprises only a subset of boundary cell values corresponding to the first input value. A second value is input and a comparison, by the reduced lookup table circuit, of the second value to each of the boundary cell values in the subset of boundary cell values is performed. The reduced lookup table circuit outputs an output value based on results of the comparison of the second value to each of the boundary cell values in the subset of boundary cell values.
    • 提供了利用减少的查找表电路在数据处理装置中执行操作的机制。 输入第一输入值,用于从缩小的查找表电路中选择值的子集。 缩小的查找表电路仅存储来自对应于缩小的查找表电路的完全填充查找表的边界单元值。 值的子集仅包括对应于第一输入值的边界单元值的子集。 输入第二值,并且通过缩小查找表电路将第二值与边界单元值子集中的每个边界单元值进行比较。 缩小查找表电路基于第二值与边界单元值子集中的每个边界单元值的比较的结果来输出输出值。
    • 65. 发明授权
    • Process identifier-based cache data transfer
    • 基于进程标识符的缓存数据传输
    • US08904100B2
    • 2014-12-02
    • US13493636
    • 2012-06-11
    • Fadi Y. BusabaSteven R. CarloughChristopher A. KrygowskiBrian R. PraskyChung-Lung K. Shum
    • Fadi Y. BusabaSteven R. CarloughChristopher A. KrygowskiBrian R. PraskyChung-Lung K. Shum
    • G06F12/02
    • G06F17/30982G06F12/0817G06F12/12
    • Embodiments of the invention relate to process identifier (PID) based cache information transfer. An aspect of the invention includes sending, by a first core of a processor, a PID associated with a cache miss in a first local cache of the first core to a second cache of the processor. Another aspect of the invention includes determining that the PID associated with the cache miss is listed in a PID table of the second cache. Yet another aspect of the invention includes based on the PID being listed in the PID table of the second cache, determining a plurality of entries in a cache directory of the second cache that are associated with the PID. Yet another aspect of the invention includes pushing cache information associated with each of the determined plurality of entries in the cache directory from the second cache to the first local cache.
    • 本发明的实施例涉及基于过程标识符(PID)的高速缓存信息传送。 本发明的一个方面包括由处理器的第一核心将与第一核心的第一本地高速缓存中的高速缓存未命中相关联的PID发送到处理器的第二高速缓存。 本发明的另一方面包括确定与高速缓存未命中相关联的PID被列在第二高速缓存的PID表中。 本发明的另一方面包括基于PID列在第二高速缓存的PID表中,确定与PID相关联的第二高速缓存的高速缓存目录中的多个条目。 本发明的另一方面包括将高速缓存目录中的确定的多个条目中的每一个相关联的缓存信息从第二高速缓存推送到第一本地高速缓存。
    • 68. 发明授权
    • Decimal adder with end around carry
    • 十进制加法器结束周围进位
    • US08554822B2
    • 2013-10-08
    • US12822919
    • 2010-06-24
    • Steven R. CarloughAdam B. ColluraKlaus M. KroenerSilvia M. Mueller
    • Steven R. CarloughAdam B. ColluraKlaus M. KroenerSilvia M. Mueller
    • G06F7/494
    • G06F7/494G06F7/508
    • Binary code decimal (BCD) arithmetic add/subtract operations on two BCD numbers independent of which BCD number is of a greater magnitude include, responsive to the BCD arithmetic add/subtract operation being a subtract operation, performing a BCD arithmetic subtraction operation on a first BCD number and a second BCD number, the first BCD number having a first magnitude and the second BCD number having a second magnitude. The first magnitude is greater than, equal to, or less than the second magnitude. The performing includes: in parallel to a carry generation, partial sums or partial differences of the first and second BCD numbers are computer such that a final result in signed magnitude form is selectable from the partial sums or differences based on carry information without any post processing steps.
    • 对于与BCD数量不同的两个BCD号码的二进制码十进制(BCD)算术加法/减法操作包括响应于BCD算术加/减操作作为减法运算,对第一个BCD运算执行BCD运算减法运算 BCD号和第二BCD号,第一BCD号具有第一幅值,第二BCD号具有第二幅值。 第一幅度大于等于或小于第二幅度。 执行包括:与进位生成并行,第一和第二BCD号码的部分和或部分差异是计算机,使得基于携带信息的部分和或差异可以从签名幅度形式中选择最终结果,而不进行任何后处理 脚步。