中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

135 records (took 0.011 seconds)

    Stopping replay tornadoes
    71.
    发明授权
    Stopping replay tornadoes 失效
    停止重播龙卷风

    公开(公告)号：US06952764B2

    公开(公告)日：2005-10-04

    申请号：US10039588

    申请日：2001-12-31

    Applicant: David J. Sager ,  Stephan Jourdan ,  Per Hammarlund

    Inventor： David J. Sager ,  Stephan Jourdan ,  Per Hammarlund

    IPC: G06F9/30 ,  G06F9/38 ,  G06F9/40 ,  G06F15/00

    CPC classification number: G06F9/3861 ,  G06F9/3836 ,  G06F9/3838 ,  G06F9/384 ,  G06F9/3857

    Abstract: A method for stopping replay tornadoes in a processor. The method of one embodiment comprises scheduling an instruction for execution speculatively. A determination is made whether the instruction executed correctly. The instruction is routed to a replay mechanism if the instruction did not execute correctly. A determination is made whether a replay tornado exists. The instruction is routed for re-execution if the instruction executed incorrectly and no replay tornado exists. Breaking the replay tornado if the replay tornado exists. Replay safe instructions in the pipeline are retired. Non-replay safe instructions in the pipeline are marked for re-execution. The non-replay safe instructions are rescheduled for re-execution.

    Abstract translation: 一种停止在处理器中重播龙卷风的方法。 一个实施例的方法包括调查用于执行的指令。 确定指令是否正确执行。 如果指令执行不正确，指令将被路由到重播机制。 确定重播龙卷风是否存在。 如果指令执行不正确并且没有重播龙卷风存在，则该指令被路由以重新执行。 如果重播龙卷风存在，打破重播龙卷风。 回收管道中的安全说明已经退役。 管道中的非重放安全指示被标记为重新执行。 重新安排非重放安全指令以重新执行。

    Dynamic online optimizer
    72.
    发明申请
    Dynamic online optimizer 审中-公开
    动态在线优化器

    公开(公告)号：US20050149912A1

    公开(公告)日：2005-07-07

    申请号：US10748284

    申请日：2003-12-29

    Applicant: Alexandre Farcy ,  Stephan Jourdan ,  Avinash Sodani ,  Per Hammarlund

    Inventor： Alexandre Farcy ,  Stephan Jourdan ,  Avinash Sodani ,  Per Hammarlund

    IPC: G06F9/38 ,  G06F9/44

    CPC classification number: G06F9/3808 ,  G06F8/443

    Abstract: A system and method for optimizing a series of traces to be executed by a processing core is disclosed. The lines of a trace are sent to an optimizer each time they are sent to a processing core to be executed. Runtime information may be collected on a line of a trace each time that trace is executed by a processing core. The runtime information may be used by the optimizer to better optimize the micro-operations of the lines of the trace. The optimizer optimizes a trace each time the trace is executed to improve the efficiency of future iterations of the trace. Most of the optimizations result in a reduction of the number of μops within the trace. The optimizer may optimize two or more lines at a time in order to find more opportunities to remove μops and shorten the trace. The two lines may be alternately offset so that each line has the maximum allowed number of micro-operations.

    Abstract translation: 公开了一种用于优化要由处理核执行的一系列迹线的系统和方法。 每次将跟踪的行发送到执行处理核心时，都将其发送到优化器。 每次由处理核心执行跟踪时，运行时信息可以在跟踪线上收集。 优化器可以使用运行时信息来更好地优化跟踪线的微操作。 优化器每次执行跟踪时优化跟踪，以提高跟踪的未来迭代的效率。 大多数优化导致跟踪中的muops数量减少。 优化器可以一次优化两行或更多行，以便找到更多机会删除muops并缩短跟踪。 两条线可以交替地偏移，使得每条线具有允许的最大微操作数。

    Method for and a trailing store buffer for use in memory renaming
    74.
    发明申请
    Method for and a trailing store buffer for use in memory renaming 失效
    用于存储器重命名的方法和后端存储缓冲区

    公开(公告)号：US20050138339A1

    公开(公告)日：2005-06-23

    申请号：US10743422

    申请日：2003-12-23

    Applicant: Sebastien Hily ,  Per Hammarlund

    Inventor： Sebastien Hily ,  Per Hammarlund

    IPC: G06F9/30 ,  G06F9/38

    CPC classification number: G06F9/3834

    Abstract: Embodiments of the present invention relate to a memory management scheme and apparatus that enables efficient memory renaming. The method includes computing a store address, writing the store address in a first storage, writing data associated with the store address to a memory, and de-allocating the store address from the first storage, allocating the store address in a second storage, predicting a load instruction to be memory renamed, computing a load store source index, computing a load address, disambiguating the memory renamed load instruction, and retiring the memory renamed load instruction, if the store instruction is still allocated in at least one of the first storage and the second storage and should have effectively provided to the load the full data. The method may also include re-executing the load instruction without memory renaming, if the store instruction is not in at the first storage or in the second storage.

    Abstract translation: 本发明的实施例涉及一种能够实现高效存储器重命名的存储器管理方案和装置。 该方法包括计算存储地址，将存储地址写入第一存储器中，将与存储地址相关联的数据写入存储器，以及从第一存储器解除存储地址，在第二存储器中分配存储地址，预测存储地址 如果所述存储指令仍被分配在所述第一存储器中的至少一个中，则存储指令被重新命名为存储器重命名的加载指令，计算加载存储源索引，计算加载地址，消除所述存储器重命名的加载指令，以及退出所述存储器重命名加载指令， 并且第二个存储应该有效地提供给负载的完整数据。 如果存储指令不在第一存储器或第二存储器中，则该方法还可以包括重新执行加载指令而不进行存储器重命名。

Patent Agency Ranking