会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 22. 发明授权
    • Circuits and methods for recovering link stack data upon branch instruction mis-speculation
    • 在分支指令错误猜测时恢复链路栈数据的电路和方法
    • US06848044B2
    • 2005-01-25
    • US09801608
    • 2001-03-08
    • Lee Evan EisenJames Allan KahleBalaram SinharoyWilliam John Starke
    • Lee Evan EisenJames Allan KahleBalaram SinharoyWilliam John Starke
    • G06F9/38G06F15/00
    • G06F9/3806G06F9/30054G06F9/3861
    • A method of performing operations to a link stack including the step of performing a Pop operation from the link stack which includes the substeps of storing a first pointer value to the link stack, the first pointer value being the value of a pointer to the link stack before the Pop operation, and storing a first address including a first tag popped from the link stack. The method further includes the step of performing a Push operation to the link stack which includes the substeps of storing a second address including a second tag being Pushed into the link stack and storing a second pointer to the link stack, the second pointer being the value of the pointer to the link stack after the Push operation. The method additionally provides for the recovering of the link stack following an instruction flush which includes the substeps of comparing the first pointer value and the second value, comparing the first tag and the second tag, and replacing an address at the top of the link stack with the first address when the first and second pointers match and the first and second tags match.
    • 一种对链接堆栈执行操作的方法,包括从链路堆栈执行弹出操作的步骤,该链路栈包括将第一指针值存储到链路栈的子步骤,第一指针值是指向链路栈的指针的值 并且存储包括从链接堆栈弹出的第一标签的第一地址。 该方法还包括对链路堆栈执行Push操作的步骤,该链路栈包括存储第二地址的子步骤,该第二地址包括被推入到链路栈中的第二标签,并将第二指针存储到链路栈,第二指针是值 在Push操作后指向链接堆栈的指针。 该方法另外提供了在包括比较第一指针值和第二值的子步骤的指令刷新之后恢复链路栈,比较第一标签和第二标签,以及替换链路栈顶部的地址 当第一和第二指针匹配并且第一和第二标签匹配时具有第一地址。
    • 24. 发明授权
    • Microprocessor with primary and secondary issue queue
    • 具有主和次发行队列的微处理器
    • US06609190B1
    • 2003-08-19
    • US09478311
    • 2000-01-06
    • James Allan KahleCharles Roberts Moore
    • James Allan KahleCharles Roberts Moore
    • G06F930
    • G06F9/3865G06F9/30149G06F9/3017G06F9/30174G06F9/3836G06F9/3838G06F9/384G06F9/3853G06F9/3857
    • A processor and data processing system suitable for dispatching an instruction to an issue unit. The issue unit includes a primary issue queue and a secondary issue queue. The instruction is stored in the primary issue queue if the instruction is currently eligible to issue for execution. The instruction is stored in the secondary issue queue if the instruction is currently ineligible to issue for execution. An instruction may be moved from the primary issue queue to the secondary issue queue if instruction is dependent upon results from another instruction. In one embodiment, the instruction may be moved from the primary issue queue to the secondary issue queue after issuing the instruction for execution. In this embodiment, the instruction may be maintained in the secondary issue queue for a specified duration. Thereafter, the secondary issue queue entry containing the instruction is deallocated if the instruction has not been rejected.
    • 一种处理器和数据处理系统,适用于向发布单元发送指令。 问题单元包括主要问题队列和次要问题队列。 如果指令当前有资格发行执行,指令将存储在主要问题队列中。 如果该指令当前不符合要发行执行的规定,则该指令存储在辅助发行队列中。 如果指令取决于另一个指令的结果,则指令可以从主要问题队列移动到次要发布队列。 在一个实施例中,在发出用于执行的指令之后,指令可以从主要问题队列移动到次要发布队列。 在该实施例中,可以在指定持续时间内将指令维持在次要发行队列中。 此后,如果指令未被拒绝,则包含指令的次要发行队列条目被解除分配。
    • 26. 发明授权
    • 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.
    • 28. 发明授权
    • 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.
    • 一种用于处理器系统中的原子存储器访问的方法和系统,其中所述处理器系统能够相对于特定程序顺序发出并执行不正常的多个指令。 推测性地向处理器系统的执行单元发出第一预约指令。 在发行时,响应于在程序中的第一预约指令之后发生的执行单元中检测到任何先前执行的预定指令而从执行单元中刷新在程序顺序中的第一预约指令之后发生的执行单元排队的指令 订购。 响应于在程序顺序中的第一预约指令之前发生的执行单元排队的指令的完成,通过对第一预约指令的特定数据地址进行预约来推测地执行第一预约指令,使得预约指令 相对于合作条件存储指令,以任何顺序被推测地发行和执行的这些被按顺序执行。
    • 29. 发明授权
    • Method and system for increased instruction dispatch efficiency in a
superscalar processor system
    • 用于在超标量处理器系统中提高指令调度效率的方法和系统
    • US5978896A
    • 1999-11-02
    • US289801
    • 1994-08-12
    • James Allan KahleChin-Cheng KauDavid Steven LevitanAubrey Deene Ogden
    • James Allan KahleChin-Cheng KauDavid Steven LevitanAubrey Deene Ogden
    • G06F9/38
    • G06F9/3814G06F9/3802G06F9/3885
    • A method and system for increased instruction dispatch efficiency in a superscalar processor system having an instruction queue for receiving a group of instructions in an application specified sequential order and an instruction dispatch unit for dispatching instructions from an associated instruction buffer to multiple execution units on an opportunistic basis. The dispatch status of instructions within the associated instruction buffer is periodically determined and, in response to a dispatch of the instructions at the beginning of the instruction buffer, the remaining instructions are shifted within the instruction buffer in the application specified sequential order and a partial group of instructions are loaded into the instruction buffer from the instruction queue utilizing a selectively controlled multiplex circuit. In this manner additional instructions may be dispatched to available execution units without requiring a previous group of instructions to be dispatched completely.
    • 一种用于在具有指令队列的超标量处理器系统中提高指令调度效率的方法和系统,所述指令队列用于以应用指定的顺序顺序接收一组指令,以及指令调度单元,用于将指令从相关联的指令缓冲器分派到多个执行单元, 基础。 周期性地确定关联指令缓冲器内的指令的调度状态,并且响应于在指令缓冲器的开始处的指令的调度,剩余的指令在应用指定的顺序顺序的指令缓冲器内移动,部分组 的指令通过选择性控制的多路复用电路从指令队列加载到指令缓冲器中。 以这种方式,可以将附加指令分派到可用的执行单元,而不需要完全调度先前的指令组。
    • 30. 发明授权
    • Method and system for processing branch instructions during emulation in
a data processing system
    • 用于在数据处理系统中仿真期间处理分支指令的方法和系统
    • US5956495A
    • 1999-09-21
    • US934857
    • 1997-09-22
    • James Allan KahleSoummya Mallick
    • James Allan KahleSoummya Mallick
    • G06F9/32G06F9/455
    • G06F9/30174G06F9/3879G06F9/45504
    • A series of guest instructions including at least one guest branch instruction and other guest instructions are stored in memory. In addition, one or more semantic routines that are formed of native instructions and that may be utilized to emulate the series of guest instructions are stored in memory. For each other guest instruction in the series of guest instructions, an entry is stored in a multiple-entry queue in order of receipt of the other guest instructions. Each entry includes an indication of a location in memory of at least one semantic routine and a condition field indicating conditions that may be set or reset by the associated guest instruction. In response to the entries in the multiple-entry queue, the series of guest instructions are emulated in the processor by using the entries to access and execute selected ones of the one or more semantic routines. In response to detection of a conditional guest branch instruction in the series of guest instructions, a determination is made whether an entry in the multiple-entry queue associated with an instruction preceding the conditional guest branch instruction in the series has a condition field including an indication of a condition upon which the conditional branch instruction depends. If so, the indication is utilized to resolve the conditional guest branch instruction.
    • 包括至少一个客户分支指令和其他访客指令的一系列访客指令被存储在存储器中。 此外,由本地指令形成并且可以用于模拟一系列访客指令的一个或多个语义例程被存储在存储器中。 对于一系列访客指令中的每个其他客人指令,根据接收到其他访客指令的顺序,将条目存储在多个入口队列中。 每个条目包括存储至少一个语义例程的位置的指示和指示可以由相关联的客户指令设置或重置的条件的条件字段。 响应于多入口队列中的条目,通过使用条目访问和执行一个或多个语义例程中的选定的条目来在处理器中仿真一系列访客指令。 响应于一系列访客指令中的条件访客分支指令的检测,确定与该系列中的条件访客分支指令之前的指令相关联的多入口队列中的条目是否具有包括指示的条件字段 条件分支指令所依赖的条件。 如果是,则使用该指示来解析条件访客分支指令。