会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • CONDITIONAL STORE INSTRUCTIONS IN AN OUT-OF-ORDER EXECUTION MICROPROCESSOR
    • 不合格执行微处理器的条件存储指令
    • US20140122843A1
    • 2014-05-01
    • US14007097
    • 2012-04-06
    • G. Glenn HenryTerry ParksRodney E. HookerGerard M. ColColin Eddy
    • G. Glenn HenryTerry ParksRodney E. HookerGerard M. ColColin Eddy
    • G06F9/38G06F9/30
    • G06F9/3017G06F9/30076G06F9/30123G06F9/30174G06F9/30189G06F9/30196
    • An instruction translator translates a conditional store instruction (specifying data register, base register, and offset register of the register file) into at least two microinstructions. An out-of-order execution pipeline executes the microinstructions. To execute a first microinstruction, an execution unit receives a base value and an offset from the register file and generates a first result as a function of the base value and offset. The first result specifies the memory location address. To execute a second microinstruction, an execution unit receives the first result and writes the first result to an allocated entry in the store queue if the condition flags satisfy the condition (the store queue subsequently writes the data to the memory location specified by the address), and otherwise kills the allocated store queue entry so that the store queue does not write the data to the memory location specified by the address.
    • 指令翻译器将条件存储指令(指定寄存器文件的指定数据寄存器,基址寄存器和偏移寄存器)转换为至少两个微指令。 无序执行管线执行微指令。 为了执行第一微指令,执行单元从寄存器文件接收基值和偏移量,并且产生作为基值和偏移量的函数的第一结果。 第一个结果指定内存位置地址。 为了执行第二微指令,如果条件标志满足条件(存储队列随后将数据写入由地址指定的存储器位置),则执行单元接收第一结果并将第一结果写入存储队列中的已分配条目, ,否则将杀死所分配的存储队列条目,使得存储队列不将数据写入由地址指定的存储器位置。
    • 4. 发明授权
    • Efficient pseudo-LRU for colliding accesses
    • 有效的伪LRU用于冲突访问
    • US08301842B2
    • 2012-10-30
    • US12830588
    • 2010-07-06
    • Colin EddyRodney E. Hooker
    • Colin EddyRodney E. Hooker
    • G06F12/00
    • G06F12/0864G06F12/123G06F12/128
    • An apparatus for allocating entries in a set associative cache memory includes an array that provides a first pseudo-least-recently-used (PLRU) vector in response to a first allocation request from a first functional unit. The first PLRU vector specifies a first entry from a set of the cache memory specified by the first allocation request. The first vector is a tree of bits comprising a plurality of levels. Toggling logic receives the first vector and toggles predetermined bits thereof to generate a second PLRU vector in response to a second allocation request from a second functional unit generated concurrently with the first allocation request and specifying the same set of the cache memory specified by the first allocation request. The second vector specifies a second entry different from the first entry from the same set. The predetermined bits comprise bits of a predetermined one of the levels of the tree.
    • 用于在集合关联高速缓冲存储器中分配条目的装置包括响应于来自第一功能单元的第一分配请求而提供第一伪最近最近使用(PLRU)向量的阵列。 第一个PLRU向量指定由第一个分配请求指定的一组缓存中的第一个条目。 第一向量是包括多个级别的比特树。 切换逻辑接收第一向量并切换其预定比特以响应于来自与第一分配请求同时生成的第二功能单元的第二分配请求生成第二PLRU向量,并且指定由第一分配指定的高速缓冲存储器的相同集合 请求。 第二个向量指定与同一集合中的第一条目不同的第二条目。 预定比特包括树的预定的一个级别的比特。
    • 5. 发明授权
    • Microprocessor with microarchitecture for efficiently executing read/modify/write memory operand instructions
    • 具有微架构的微处理器,用于高效执行读/写/写存储器操作数指令
    • US08069340B2
    • 2011-11-29
    • US12100616
    • 2008-04-10
    • Rodney E. HookerGerard M. ColColin Eddy
    • Rodney E. HookerGerard M. ColColin Eddy
    • G06F9/30
    • G06F9/3004G06F9/30087G06F9/3017G06F9/3834G06F9/3836G06F9/3838G06F9/3855
    • A microprocessor instruction translator translates a macroinstruction into three microinstructions to perform a read/modify/write operation on a memory operand. A first microinstruction instructs the microprocessor to calculate a source address and to load the memory operand into the microprocessor from memory at the source address and to calculate a destination address. The second microinstruction instructs the microprocessor to perform an arithmetic or logical operation on the loaded memory operand to generate a result. The third microinstruction instructs the microprocessor to write the result to memory at the destination address calculated by the first microinstruction. A first execution unit receives the first microinstruction and responsively calculates the source address and loads the memory operand into the microprocessor from memory at the source address. A second execution unit also receives the first microinstruction and calculates the destination address. The first and second execution units are distinct execution units within the microprocessor.
    • 微处理器指令转换器将宏指令转换成三个微指令以对存储器操作数执行读/修改/写操作。 第一微指令指示微处理器计算源地址,并将存储器操作数从源地址的存储器加载到微处理器中并计算目的地地址。 第二微指令指示微处理器对加载的存储器操作数执行算术或逻辑运算以产生结果。 第三个微指令指示微处理器将结果写入由第一个微指令计算的目标地址的存储器。 第一执行单元接收第一微指令并且响应地计算源地址并且将来自地址的存储器的存储器操作数加载到微处理器中。 第二执行单元还接收第一微指令并计算目的地址。 第一和第二执行单元是微处理器内不同的执行单元。
    • 7. 发明申请
    • EFFICIENT PSEUDO-LRU FOR COLLIDING ACCESSES
    • 有效的PSEUDO-LRU用于胶接接入
    • US20110055485A1
    • 2011-03-03
    • US12830588
    • 2010-07-06
    • Colin EddyRodney E. Hooker
    • Colin EddyRodney E. Hooker
    • G06F12/08G06F12/00
    • G06F12/0864G06F12/123G06F12/128
    • An apparatus for allocating entries in a set associative cache memory includes an array that provides a first pseudo-least-recently-used (PLRU) vector in response to a first allocation request from a first functional unit. The first PLRU vector specifies a first entry from a set of the cache memory specified by the first allocation request. The first vector is a tree of bits comprising a plurality of levels. Toggling logic receives the first vector and toggles predetermined bits thereof to generate a second PLRU vector in response to a second allocation request from a second functional unit generated concurrently with the first allocation request and specifying the same set of the cache memory specified by the first allocation request. The second vector specifies a second entry different from the first entry from the same set. The predetermined bits comprise bits of a predetermined one of the levels of the tree.
    • 用于在集合关联高速缓冲存储器中分配条目的装置包括响应于来自第一功能单元的第一分配请求而提供第一伪最近最近使用(PLRU)向量的阵列。 第一个PLRU向量指定由第一个分配请求指定的一组缓存中的第一个条目。 第一向量是包括多个级别的比特树。 切换逻辑接收第一向量并且切换其预定比特以响应于来自与第一分配请求同时生成的第二功能单元的第二分配请求生成第二PLRU向量,并且指定由第一分配指定的高速缓冲存储器的相同集合 请求。 第二个向量指定与同一集合中的第一条目不同的第二条目。 预定比特包括树的预定的一个级别的比特。
    • 9. 发明申请
    • DATA CACHE WITH MODIFIED BIT ARRAY
    • 数据缓存与修改的位阵列
    • US20100306475A1
    • 2010-12-02
    • US12472845
    • 2009-05-27
    • Rodney E. HookerColin EddyG. Glenn Henry
    • Rodney E. HookerColin EddyG. Glenn Henry
    • G06F12/08G06F12/00
    • G06F12/0831G06F9/30043G06F9/30047
    • A cache memory system includes a first array of storage elements each configured to store a cache line, a second array of storage elements corresponding to the first array of storage elements each configured to store a first partial status of the cache line in the corresponding storage element of the first array, and a third array of storage elements corresponding to the first array of storage elements each configured to store a second partial status of the cache line in the corresponding storage element of the first array. The second partial status indicates whether or not the cache line has been modified. When the cache memory system modifies the cache line within a storage element of the first array, it writes only the second partial status in the corresponding storage element of the third array to indicate that the cache line has been modified but refrains from writing the first partial status in the corresponding storage element of the second array. The cache memory system reads both the first partial status and the second partial status to determine the full status.
    • 高速缓冲存储器系统包括:第一阵列的存储元件,每个存储元件被配置为存储高速缓存行;对应于第一存储元件阵列的存储元件的第二阵列,每个存储元件阵列被配置为将高速缓存行的第一部分状态存储在相应的存储元件中 以及与所述第一阵列存储元件相对应的存储元件的第三阵列,每个存储元件被配置为将所述高速缓存线的第二部分状态存储在所述第一阵列的相应存储元件中。 第二部分状态指示高速缓存行是否已被修改。 当高速缓冲存储器系统修改第一阵列的存储元件内的高速缓存线时,它仅将第二部分状态写入第三阵列的相应存储元件中,以指示高速缓存线已被修改,但是避免写入第一部分 状态在第二个阵列的相应的存储元素中。 缓存存储器系统读取第一部分状态和第二部分状态以确定完整状态。
    • 10. 发明申请
    • MICROPROCESSOR THAT PERFORMS SPECULATIVE TABLEWALKS
    • MICROPROCESSOR表现出结果表
    • US20100011188A1
    • 2010-01-14
    • US12172729
    • 2008-07-14
    • Colin EddyRodney E. Hooker
    • Colin EddyRodney E. Hooker
    • G06F9/26
    • G06F12/10G06F9/383G06F9/3842G06F2212/654
    • A microprocessor performs a speculative page tablewalk. The microprocessor includes a tablewalk engine that determines whether at least one of a predetermined set of conditions exists with respect to characteristics of the page of memory whose physical address specified by a memory access instruction is missing in the TLB, performs operations of the tablewalk in an out-of-order manner with respect to the execution of unretired program instructions older than the memory access instruction while none of the predetermined set of conditions exists, and waits to perform the operations of the tablewalk until the microprocessor has retired all program instructions older than the memory access instruction when at least one of the predetermined set of conditions exists. The predetermined set of conditions may include the tablewalk needing to load information from a strongly-ordered page, update page mapping information, or access a global page.
    • 微处理器执行投机页面行进。 该微处理器包括一台行进引擎,其确定相对于存储器访问指令所指定的物理地址的存储器页面的特性,存在预定的一组条件中的至少一个,在TLB中执行台式机的操作 相对于执行比存储器存取指令更早的程序指令执行,而不存在预定的一组条件,并且等待执行台式机的操作,直到微处理器已经退出所有程序指令 当存在预定的一组条件中的至少一个时,存储器访问指令。 预定的条件集合可以包括需要从强排序页面加载信息的行进台,更新页面映射信息或访问全局页面。