会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Method and system for recoding noneffective instructions within a data
processing system
    • 在数据处理系统内重新编码无效指令的方法和系统
    • US5619408A
    • 1997-04-08
    • US387145
    • 1995-02-10
    • Bryan BlackMarvin A. DenmanLee E. EisenRobert T. GollaAlbert J. Loper, Jr.Soummya MallickRussell A. Reininger
    • Bryan BlackMarvin A. DenmanLee E. EisenRobert T. GollaAlbert J. Loper, Jr.Soummya MallickRussell A. Reininger
    • G06F9/30G06F9/318G05B15/00
    • G06F9/3017G06F9/30145
    • A method and system are disclosed for processing instructions within a data processing system including a processor having a plurality of execution units. According to the method of the present invention, a number of instructions stored within a memory within the data processing system are retrieved from memory. A selected instruction among the number of instructions is decoded to determine if the selected instruction would be noneffective if executed by the processor. In a preferred embodiment of the present invention, noneffective instructions include instructions with invalid opcodes and instructions that would not change the value of any data register within the processor. In response to determining that the selected instruction would be noneffective if executed by the processor, the selected instruction is recoded into a specified instruction format prior to dispatching the selected instruction to one of the number of execution units. Detecting noneffective instructions prior to dispatch reduces the decode logic required within the dispatcher and enhances processor performance.
    • 公开了一种用于处理包括具有多个执行单元的处理器的数据处理系统内的指令的方法和系统。 根据本发明的方法,从存储器中检索存储在数据处理系统内的存储器内的多个指令。 解码指令数目中的选择指令,以确定所选择的指令是否由处理器执行时是无效的。 在本发明的优选实施例中,无效指令包括具有无效操作码的指令和不会改变处理器内的任何数据寄存器的值的指令。 响应于确定所选择的指令如果由处理器执行将是无效的,则在将所选择的指令分派到多个执行单元之一之前,所选择的指令被重新编码为指定的指令格式。 在调度之前检测无效指令可减少调度程序中所需的解码逻辑,并提高处理器的性能。
    • 4. 发明授权
    • Generating predicted branch target address from two entries storing portions of target address based on static/dynamic indicator of branch instruction type
    • 基于分支指令类型的静态/动态指示符,从存储部分目标地址的两个条目生成预测分支目标地址
    • US08694759B2
    • 2014-04-08
    • US12945732
    • 2010-11-12
    • James D. DundasMarvin A. Denman
    • James D. DundasMarvin A. Denman
    • G06F9/38
    • G06F9/3804G06F9/3808
    • A method and apparatus to utilize a branch prediction scheme that limits the expenditure of power and the area consumed caused by branch prediction schemes is provided. The method includes accessing a first entry and a second entry of the data structure, wherein each entry stores a portion of a predicted target address, determining the predicted target address using the portion of the predicted target address stored in the first entry and a portion of a branch address of a fetched branch instruction for a fetched branch instruction of a first type, and determining the predicted target address using the portion of the predicted target address stored in the first entry and the portion of the predicted target address stored in the second entry for a fetched branch instruction of a second type.
    • 提供了一种利用分支预测方案的方法和装置,其限制了功率消耗和由分支预测方案引起的消耗的面积。 该方法包括访问数据结构的第一条目和第二条目,其中每个条目存储预测目标地址的一部分,使用存储在第一条目中的预测目标地址的部分确定预测目标地址, 用于获取的第一类型的分支指令的获取分支指令的分支地址,以及使用存储在第一条目中的预测目标地址的部分和存储在第二条目中的预测目标地址的部分来确定预测目标地址 对于第二类型的获取的分支指令。
    • 7. 发明授权
    • Method of operating a data processor with rapid address comparison for
data forwarding
    • 用于数据转发的快速地址比较操作数据处理器的方法
    • US5613081A
    • 1997-03-18
    • US526398
    • 1995-09-11
    • Bryan P. BlackMarvin A. Denman
    • Bryan P. BlackMarvin A. Denman
    • G06F9/38G06F12/08G06F12/00
    • G06F9/3802G06F12/0859
    • A data processor (10) has an execution unit (18, 20) for generating the address of each requested data double-word. The data processor fetches the entire memory line, four double-words of data, containing the requested double-word when the requested double-word is not found in the data processor's memory cache. The data processor ultimately stores the requested data in the memory cache (40) when returned from an external memory system. The data processor also has forwarding circuitry (48, 50) for forwarding previously requested double-words directly to the execution unit under certain circumstances. The forwarding circuitry will forward a requested double-word if the data processor has not crossed a memory line boundary since the last memory cache miss and if the two least significant bits of the requested and received double-words logically match.
    • 数据处理器(10)具有用于产生每个请求数据双字的地址的执行单元(18,20)。 数据处理器在数据处理器的存储器高速缓存中未找到所请求的双字时,提取整个存储器行,四个双字数据,其中包含所请求的双字。 当从外部存储器系统返回时,数据处理器最终将所请求的数据存储在存储器高速缓存(40)中。 数据处理器还具有用于在某些情况下将先前请求的双字直接转发到执行单元的转发电路(48,50)。 如果数据处理器自上次存储器高速缓存未命中以来没有超过存储器线边界,并且所请求和接收的双字的两个最低有效位逻辑上匹配,转发电路将转发所请求的双字。
    • 8. 发明授权
    • Data processor for simultaneously searching two fields of the rename
buffer having first and second most recently allogated bits
    • 用于同时搜索重命名缓冲器的两个字段的数据处理器,其具有第一和第二最近的同步位
    • US5493669A
    • 1996-02-20
    • US25453
    • 1993-03-03
    • Marvin A. Denman, Jr.
    • Marvin A. Denman, Jr.
    • G06F9/38G06F9/32G06F9/42
    • G06F9/30061G06F9/3836G06F9/3838G06F9/384G06F9/3842G06F9/3857G06F9/3863
    • A data processor has a plurality of execution units (12), a rename buffer (14) coupled to at least one of the execution units and a plurality of architectural registers (16) coupled to at least one execution unit and to the rename buffer. The rename buffer periodically receives and stores the result and periodically receives requests for the operand. Each received result and operand is associated with an architectural register. The rename buffer periodically forwards one of a set of received results to an execution unit. Each received result of the set is associated with the same architectural register. The rename buffer is operable to determine which entry is the most recently allocated among several that will update the same architectural register. This ability to both manage results destined for the same architectural register and to forward only the appropriate value increases data processor throughput and reduces instruction stalls.
    • 数据处理器具有多个执行单元(12),耦合到至少一个执行单元的重命名缓冲器(14)和耦合到至少一个执行单元和重命名缓冲器的多个架构寄存器(16)。 重命名缓冲区周期性地接收并存储结果并周期性地接收对操作数的请求。 每个接收到的结果和操作数与架构寄存器相关联。 重命名缓冲器周期性地将一组接收结果中的一个转发到执行单元。 该集合的每个接收结果与相同的架构寄存器相关联。 重命名缓冲区可操作以确定哪些条目是最近在几个将更新相同架构寄存器之间分配的条目。 这种管理结果的能力同样适用于同一架构寄存器,并仅转发适当的值可以提高数据处理器吞吐量并减少指令停顿。
    • 10. 发明申请
    • BRANCH PREDICTION SCHEME UTILIZING PARTIAL-SIZED TARGETS
    • 分支预测方案利用部分大小的目标
    • US20120124347A1
    • 2012-05-17
    • US12945732
    • 2010-11-12
    • James D. DundasMarvin A. Denman
    • James D. DundasMarvin A. Denman
    • G06F9/38
    • G06F9/3804G06F9/3808
    • A method and apparatus to utilize a branch prediction scheme that limits the expenditure of power and the area consumed caused by branch prediction schemes is provided. The method includes accessing a first entry and a second entry of the data structure, wherein each entry stores a portion of a predicted target address, determining the predicted target address using the portion of the predicted target address stored in the first entry and a portion of a branch address of a fetched branch instruction for a fetched branch instruction of a first type, and determining the predicted target address using the portion of the predicted target address stored in the first entry and the portion of the predicted target address stored in the second entry for a fetched branch instruction of a second type.
    • 提供了一种利用分支预测方案的方法和装置,其限制了功率消耗和由分支预测方案引起的消耗的面积。 该方法包括访问数据结构的第一条目和第二条目,其中每个条目存储预测目标地址的一部分,使用存储在第一条目中的预测目标地址的部分确定预测目标地址, 用于获取的第一类型的分支指令的获取分支指令的分支地址,以及使用存储在第一条目中的预测目标地址的部分和存储在第二条目中的预测目标地址的部分来确定预测目标地址 对于第二类型的获取的分支指令。