会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Queuing method and apparatus for facilitating the rejection of sequential instructions in a processor
    • 排队方法和装置,用于便于在处理器中拒绝顺序指令
    • US06237081B1
    • 2001-05-22
    • US09213319
    • 1998-12-16
    • Hung Qui LeLarry Edward ThatcherBruce Joseph RonchettiDavid James Shippy
    • Hung Qui LeLarry Edward ThatcherBruce Joseph RonchettiDavid James Shippy
    • G06F932
    • G06F9/3836G06F9/384G06F9/3857G06F9/3861
    • A processor (100) includes an issue unit (125) having an issue queue (144) for issuing instructions to an execution unit (140). The execution unit (140) may accept and execute the instruction or produce a reject signal. After each instruction is issued, the issue queue (144) retains the issued instruction for a critical period. After the critical period, the issue queue (144) may drop the issued instruction unless the execution unit (140) has generated a reject signal. If the execution unit (140) has generated a reject signal, the instruction is eventually marked in the issue queue (144) as being available to be reissued. The length of time that the rejected instruction is held from reissue may be modified depending upon the nature of the rejection by the execution unit (140). Also, the execution unit (140) may conduct corrective actions in response to certain reject conditions so that the instruction may be fully executed upon reissue.
    • 处理器(100)包括具有用于向执行单元(140)发出指令的发布队列(144)的发布单元(125)。 执行单元(140)可接受并执行该指令或产生拒绝信号。 在发出每条指令之后,发出队列(144)保留发出的关键周期指令。 在关键时段之后,发布队列(144)可以放弃发出的指令,除非执行单元(140)已经产生了拒绝信号。 如果执行单元(140)已经产生了拒绝信号,则指令最终在发布队列(144)中被标记为可重新发行。 可以根据执行单元(140)的拒绝的性质来修改拒绝指令从重新发行保持的时间长度。 此外,执行单元(140)可以响应于某些拒绝条件进行校正动作,使得可以在重新发布时完全执行该指令。
    • 3. 发明授权
    • Method and system for optimally issuing dependent instructions based on speculative L2 cache hit in a data processing system
    • 用于根据数据处理系统中的推测性L2缓存命中来最优地发布依赖指令的方法和系统
    • US06490653B1
    • 2002-12-03
    • US09325397
    • 1999-06-03
    • Robert Alan CargnoniBruce Joseph RonchettiDavid James ShippyLarry Edward Thatcher
    • Robert Alan CargnoniBruce Joseph RonchettiDavid James ShippyLarry Edward Thatcher
    • G06F1208
    • G06F9/383G06F9/3842
    • A method for optimally issuing instructions that are related to a first instruction in a data processing system is disclosed. The processing system includes a primary and secondary cache. The method and system comprises speculatively indicating a hit of the first instruction in a secondary cache and releasing the dependent instructions. The method and system includes determining if the first instruction is within the secondary cache. The method and system further includes providing data related to the first instruction from the secondary cache to the primary cache when the instruction is within the secondary cache. A method and system in accordance with the present invention causes instructions that create dependencies (such as a load instruction) to signal an issue queue (which is responsible for issuing instructions with resolved conflicts) in advance, that the instruction will complete in a predetermined number of cycles. In an embodiment, a core interface unit (CIU) will signal an execution unit such as the Load Store Unit (LSU) that it is assumed that the instruction will hit in the L2 cache. An issue queue uses the signal to issue dependent instructions at an optimal time. If the instruction misses in the L2 cache, the cache hierarchy causes the instructions to be abandoned and re-executed when the data is available.
    • 公开了一种用于最佳地发出与数据处理系统中的第一指令相关的指令的方法。 处理系统包括主缓存和二级缓存。 所述方法和系统包括推测性地指示二次高速缓存中的第一指令的命中并释放依赖指令。 该方法和系统包括确定第一指令是否在二级高速缓存内。 所述方法和系统还包括当所述指令在所述辅助高速缓存内时,将与所述第二指令相关的数据提供给所述主缓存。 根据本发明的方法和系统预先产生依赖性(诸如加载指令)的指令来发送发出队列(其负责发出具有解决的冲突的指令),指令将以预定数量完成 的周期。 在一个实施例中,核心接口单元(CIU)将向诸如加载存储单元(LSU)的执行单元发出信号,假定该指令将在L2高速缓存中命中。 问题队列使用信号在最佳时间发出相关指令。 如果L2缓存中的指令丢失,则缓存层次结构会导致在数据可用时放弃指令并重新执行指令。
    • 5. 发明授权
    • Determining successful completion of an instruction by comparing the number of pending instruction cycles with a number based on the number of stages in the pipeline
    • US06658555B1
    • 2003-12-02
    • US09435077
    • 1999-11-04
    • James Allan KahleHung Qui LeCharles Roberts MooreDavid James ShippyLarry Edward Thatcher
    • James Allan KahleHung Qui LeCharles Roberts MooreDavid James ShippyLarry Edward Thatcher
    • G06F930
    • G06F9/3836G06F9/384G06F9/3853G06F9/3855G06F9/3857G06F9/3865G06F9/3867G06F9/3885
    • A microprocessor and related method and data processing system are disclosed. The microprocessor includes a dispatch unit suitable for issuing an instruction executable by the microprocessor, an execution pipeline configured to receive the issued instruction, and a pending instruction unit. The pending instruction unit includes a set of pending instruction entries. A copy of the issued instruction is maintained in one of the set of pending instruction entries. The execution pipeline is adapted to record, in response detecting to a condition preventing the instruction from successfully completing one of the stages in the pipeline during a current cycle, an exception status with the copy of the instruction in the pending instruction unit and to advance the instruction to a next stage in the pipeline in the next cycle thereby preventing the condition from stalling the pipeline. Preferably, the dispatch unit, in response to the instruction finishing pipeline execution with an exception status, is adapted to use the copy of the instruction to re-issue the instruction to the execution pipeline in a subsequent cycle. In one embodiment, the dispatch unit is adapted to deallocate the copy of the instruction in the pending instruction unit in response to the instruction successfully completing pipeline execution. The pending instruction unit may detect successful completion of the instruction by detecting when the instruction has been pending for a predetermined number of cycles without recording an exception status. In this embodiment, each entry in the pending instruction unit may include a timer field comprising a set of bits wherein the number of bits in the time field equals the predetermined number of cycles. The pending instruction unit may set, in successive cycles, successive bits in the timer field such that successful completion of an instruction is indicated when a last bit in the time field is set. In one embodiment, pending instruction unit includes a set of copies of instructions corresponding to each of a set of instructions pending in the execution pipeline at any given time. In various embodiments, the execution pipeline may comprise a load/store pipeline, a floating point pipeline, or a fixed point pipeline.
    • 7. 发明授权
    • Superscaler processor and method for efficiently recovering from misaligned data addresses
    • 超标量处理器和方法可以有效地从不对齐的数据地址中恢复
    • US06289428B1
    • 2001-09-11
    • US09366599
    • 1999-08-03
    • John Edward DerrickHung Qui LeDavid James ShippyLarry Edward Thatcher
    • John Edward DerrickHung Qui LeDavid James ShippyLarry Edward Thatcher
    • G06F1202
    • G06F9/30043G06F9/3824G06F12/04
    • A superscalar processor and method are disclosed for efficiently recovering from misaligned data addresses. The processor includes a memory device partitioned into a plurality of addressable memory units. Each of the plurality of addressable memory units has a width of a first plurality of bytes. A determination is made regarding whether a data address included within a memory access instruction is misaligned. The data address is misaligned if it includes a first data segment located in a first addressable memory unit and a second data segment located in a second addressable memory unit where the first and second data segments are separated by an addressable memory unit boundary. In response to a determination that the data address is misaligned, a first internal instruction is executed which accesses the first memory unit and obtains the first data segment. A second internal instruction is executed which accesses the second memory unit and obtains the second data segment. The first and second data segments are merged together. All of the instructions executed by the processor are constrained by the memory boundary and do not access memory across the memory boundary.
    • 公开了一种超标量处理器和方法,用于从未对准的数据地址有效地恢复。 处理器包括划分成多个可寻址存储器单元的存储器件。 多个可寻址存储器单元中的每一个具有第一多个字节的宽度。 确定存储器访问指令中包括的数据地址是否不对齐。 如果数据地址包括位于第一可寻址存储器单元中的第一数据段和位于第二可寻址存储器单元中的第二数据段,其中第一和第二数据段由可寻址存储器单元边界分隔,则该数据地址未对准。 响应于确定数据地址未对准,执行访问第一存储器单元并获得第一数据段的第一内部指令。 执行访问第二存储器单元并获得第二数据段的第二内部指令。 第一和第二数据段合并在一起。 由处理器执行的所有指令都受到存储器边界的约束,并且不会跨越存储器边界访问存储器。
    • 8. 发明授权
    • Recovery from hang condition in a microprocessor
    • US06543002B1
    • 2003-04-01
    • US09435066
    • 1999-11-04
    • James Allan KahleHung Qui LeKevin F. ReickDavid James ShippyLarry Edward Thatcher
    • James Allan KahleHung Qui LeKevin F. ReickDavid James ShippyLarry Edward Thatcher
    • G06F1100
    • G06F11/0721G06F9/3861G06F11/0757G06F11/0793G06F11/1405
    • A processor and an associated method and data processing system are disclosed. The processor includes an issue unit (ISU), a completion unit, and a hang detect unit. The ISU is configured to issue instructions to an execution unit. The completion unit is adapted to produce a completion valid signal responsive to the issue unit completing an instruction. The hang detect unit is configured to receive the completion valid signal from the ISU and adapted to determine the interval since the most recent assertion of the completion valid signal. The hang detect unit is adapted to initiate a hang recovery sequence upon determining that the interval since the most recent assertion of the completion valid signal exceeds a predetermined maximum interval. In one embodiment, the hang recovery sequence includes the hang recovery unit asserting a stop completion signal to a completion unit and a stop dispatch signal to a dispatch unit to suspend instruction completion and dispatch. The hang recovery unit then asserts a force reject signal to an execution unit to reject all instructions pending in the execution unit's pipeline and a flush signal to the execution unit that results in the processor flushing a set of instructions. The hang recovery unit then negates the force reject, stop completion, and stop dispatch signals to resume processor operation. In one embodiment, the recovery sequence includes entering a relaxed execution mode, such as a debug mode, a serial operation mode, or an in-order mode prior to resuming processor operation. In one embodiment, the processor advances a completion tag upon completing an instruction. In this manner the completion tag indicates the instruction that is next to complete. In one embodiment, the hang recovery sequence includes flushing the processor of an instruction set comprising all instructions with tag information greater than the completion tag. In another embodiment, all instructions with tag information greater than or equal to the completion tag are flushed.
    • 9. 发明授权
    • Method and system for performing atomic memory accesses in a processor system
    • 用于在处理器系统中执行原子存储器访问的方法和系统
    • US06298436B1
    • 2001-10-02
    • US09327644
    • 1999-06-08
    • James Allan KahleHung Qui LeLarry Edward ThatcherDavid James Shippy
    • James Allan KahleHung Qui LeLarry Edward ThatcherDavid James Shippy
    • G06F9305
    • G06F9/3004G06F9/30072G06F9/30087G06F9/3842
    • A method and system for atomic memory accesses in a processor system, wherein the processor system is able to issue and execute multiple instructions out of order with respect to a particular program order. A first reservation instruction is speculatively issued to an execution unit of the processor system. Upon issuance, instructions queued for the execution unit which occur after the first reservation instruction in the program order are flushed from the execution unit, in response to detecting any previously executed reservation instructions in the execution unit which occur after the first reservation instruction in the program order. The first reservation instruction is speculatively executed by placing a reservation for a particular data address of the first reservation instruction, in response to completion of instructions queued for the execution unit which occur prior to the first reservation instruction in the program order, such that reservation instructions which are speculatively issued and executed in any order are executed in-order with respect to a partnering conditional store instruction.
    • 一种用于处理器系统中的原子存储器访问的方法和系统,其中所述处理器系统能够相对于特定程序顺序发出并执行不正常的多个指令。 推测性地向处理器系统的执行单元发出第一预约指令。 在发行时,响应于在程序中的第一预约指令之后发生的执行单元中检测到任何先前执行的预定指令而从执行单元中刷新在程序顺序中的第一预约指令之后发生的执行单元排队的指令 订购。 响应于在程序顺序中的第一预约指令之前发生的执行单元排队的指令的完成,通过对第一预约指令的特定数据地址进行预约来推测地执行第一预约指令,使得预约指令 相对于合作条件存储指令,以任何顺序被推测地发行和执行的这些被按顺序执行。
    • 10. 发明授权
    • System for rejecting and reissuing instructions after a variable delay time period
    • 在可变延迟时间段后拒绝和重新发出指令的系统
    • US06654876B1
    • 2003-11-25
    • US09434875
    • 1999-11-04
    • Hung Qui LeDavid James Shippy
    • Hung Qui LeDavid James Shippy
    • G06F930
    • G06F9/3855G06F9/3836G06F9/384G06F9/3857G06F9/3859G06F9/3865
    • A method, processor, and data processing system implementing a delayed reject mechanism are disclosed. The processor includes an issue unit suitable for issuing an instruction in a first cycle and a load store unit (LSU). The LSU includes an extend reject calculator circuit configured to receive a set of completion information signals and generate a delay value based thereon. The LSU is adapted to determine whether to reject the instruction in a determination cycle. The number of cycles between the first cycle and the determination cycle is a function of the delay value such that reject timing is variable with respect to the first cycle. In one embodiment, the processor is further configured to reissue the instruction after the determination cycle if the instruction was rejected in the determination cycle. The delay value is conveyed via a 2-bit bus in one embodiment. The 2 bit bus permits delaying the determination cycle from 0 to 3 cycles after a finish cycle. In one embodiment, the number of cycles between the first cycle and the determination cycle includes the number of cycles required to travel a pipeline of the microprocessor plus the number of cycles indicated by the delay value.
    • 公开了一种实现延迟拒绝机制的方法,处理器和数据处理系统。 该处理器包括适于在第一周期中发出指令的发布单元和负载存储单元(LSU)。 LSU包括扩展拒绝计算器电路,被配置为接收一组完成信息信号并基于此生成延迟值。 LSU适于确定是否在确定周期中拒绝该指令。 第一周期和确定周期之间的周期数是延迟值的函数,使得拒绝定时相对于第一周期是可变的。 在一个实施例中,处理器还被配置为在确定周期之后重新发出指令,如果指令在确定周期中被拒绝。 在一个实施例中,延迟值通过2位总线传送。 2位总线允许在完成循环后将判定周期从0到3个周期延迟。 在一个实施例中,第一周期和确定周期之间的循环次数包括行进微处理器的流水线所需的循环次数加上由延迟值指示的周期数。