会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Efficient context saving and restoring in a multi-tasking computing
system environment
    • 在多任务计算系统环境中高效的上下文保存和恢复
    • US06061711A
    • 2000-05-09
    • US699280
    • 1996-08-19
    • Seungyoon Peter SongMoataz A. MohamedHeonchul ParkLe T. NguyenJerry R. Van AkenAlessandro ForinAndrew R. Raffman
    • Seungyoon Peter SongMoataz A. MohamedHeonchul ParkLe T. NguyenJerry R. Van AkenAlessandro ForinAndrew R. Raffman
    • G06F9/44G06F9/30G06F9/38G06F9/46G06F9/48G06F17/16
    • G06F9/30087G06F9/30003G06F9/30036G06F9/30043G06F9/3009G06F9/3836G06F9/3861G06F9/3877G06F9/3887G06F9/461
    • In a multi-tasking computing system environment, one program is halted and context switched out so that a processor may context switch in a subsequent program for execution. Processor state information exists which reflects the state of the program being context switched out. Storage of this processor state information permits successful resumption of the context switched out program. When the context switched out program is subsequently context switched in, the stored processor information is loaded in preparation for successfully resuming the program at the point in which execution was previously halted. Although, large areas of memory can be allocated to processor state information storage, only a portion of this may need to be preserved across a context switch for successfully saving and resuming the context switched out program. Unnecessarily saving and loading all available processor state information can be noticeably inefficient particularly where relatively large amounts of processor state information exists. In one embodiment, a processor requests a co-processor to context switch out the currently executing program. At a predetermined appropriate point in the executing program, the co-processor responds by halting program execution and saving only the minimal amount of processor state information necessary for successful restoration of the program. The appropriate point is chosen by the application programmer at a location in the executing program that requires preserving a minimal portion of the processor information across a context switch. By saving only a minimal amount of processor information, processor time savings are accumulated across context save and restoration operations.
    • 在多任务计算系统环境中,停止一个程序并上下文切换,使得处理器可以在后续程序中上下文切换以执行。 存在反映正在上下文切换的程序的状态的处理器状态信息。 该处理器状态信息的存储允许成功恢复上下文切换程序。 当上下文切换程序随后进行上下文切换时,加载所存储的处理器信息以准备好在先前停止执行的点成功恢复程序。 尽管可以将大面积的存储器分配给处理器状态信息存储,但是只有一部分可能需要在上下文切换中被保留以成功地保存和恢复上下文切换程序。 不必要地保存和加载所有可用的处理器状态信息,特别是在存在相对大量的处理器状态信息的情况下是显着的。 在一个实施例中,处理器请求协处理器上下文切换当前执行的程序。 在执行程序中的预定的适当点处,协处理器通过停止程序执行并且仅节省成功恢复程序所需的最小量的处理器状态信息来进行响应。 应用程序员在执行程序中需要在上下文切换中保留处理器信息的最小部分的位置来选择适当的点。 通过仅节省最少量的处理器信息,可以在上下文保存和恢复操作中累积处理器时间节省。
    • 4. 发明授权
    • Scalable width vector processor architecture for efficient emulation
    • 可扩展宽度向量处理器架构,实现高效仿真
    • US5991531A
    • 1999-11-23
    • US804765
    • 1997-02-24
    • Seungyoon Peter SongHeonchul Park
    • Seungyoon Peter SongHeonchul Park
    • G06F9/06G06F9/302G06F9/318G06F9/455
    • G06F9/30014G06F9/30032G06F9/30036G06F9/3017
    • A N-byte vector processor is provided which can emulate 2N-byte processor operations by executing two N-byte operations sequentially. By using N-byte architecture to process 2N-byte wide data, chip size and costs are reduced. One embodiment allows 64-byte operations to be implemented with a 32-byte vector processor by executing a 32-byte instruction on the first 32-bytes of data and then executing a 32-byte instruction on the second 32-bytes of data. Registers and instructions for 64-byte operation are emulated using two 32-byte registers and instructions, respectively, with some instructions requiring modification to accommodate 64-byte operations between adjacent elements, operations requiring specific element locations, operations shifting elements in and out of registers, and operations specifying addresses exceeding 32 bytes.
    • 提供一个N字节向量处理器,可以通过依次执行两个N字节操作来模拟2N字节的处理器操作。 通过使用N字节架构处理2N字节的宽数据,芯片尺寸和成本降低。 一个实施例允许通过在前32个字节的数据上执行32字节指令,然后在第二个32字节数据上执行32字节指令,通过32字节向量处理器实现64字节操作。 64字节操作的寄存器和指令分别使用两个32字节寄存器和指令进行仿真,其中一些指令需要修改以适应相邻元件之间的64字节操作,需要特定元件位置的操作,将元件输入和输出寄存器 ,以及指定地址超过32个字节的操作。
    • 5. 发明授权
    • Deferred store data read with simple anti-dependency pipeline inter-lock
control in superscalar processor
    • 在超标量处理器中使用简单的反依赖管道互锁控制读取延迟存储数据
    • US5881307A
    • 1999-03-09
    • US805389
    • 1997-02-24
    • Heonchul ParkSeungyoon Peter Song
    • Heonchul ParkSeungyoon Peter Song
    • G06F9/38G06F9/40G06F9/30
    • G06F9/3816G06F9/3834G06F9/3836G06F9/3838G06F9/384G06F9/3857G06F9/3867G06F9/3885
    • A superscalar processor includes an execution unit that executes load/store instructions and an execution unit that executes arithmetic instruction. Execution pipelines for both execution units include a decode stage, a read stage that identify and read source operands for the instructions and an execution stage or stages performed in the execution units. For store instructions, reading store data from a register file is deferred until the store data is required for transfer to a memory system. This allows the store instructions to be decoded simultaneously with earlier instructions that generate the store data. A simple antidependency interlock uses a list of the register numbers identifying registers holding store data for pending store instructions. These register number are compared to the register numbers of destination operands of instructions, and instructions having destination operands matching a source of store data are stalled in the read stage to prevent the instruction from destroying store data before an earlier store instruction is complete.
    • 超标量处理器包括执行加载/存储指令的执行单元和执行算术指令的执行单元。 两个执行单元的执行流水线包括解码阶段,用于识别和读取指令的源操作数的读取阶段以及在执行单元中执行的执行阶段或阶段。 对于存储指令,从寄存器文件读取存储数据将被延迟,直到存储数据需要传输到存储器系统为止。 这允许存储指令与生成存储数据的先前指令同时解码。 一个简单的反依赖联锁使用寄存器编号列表来识别用于挂起存储指令的存储数据的寄存器。 将这些寄存器编号与指令的目标操作数的寄存器编号进行比较,并且具有与存储数据源匹配的目标操作数的指令在读取阶段停止,以防止指令在较早的存储指令完成之前破坏存储数据。
    • 9. 发明授权
    • Software hint to specify the preferred branch prediction to use for a branch instruction
    • 软件提示指定用于分支指令的首选分支预测
    • US07673122B1
    • 2010-03-02
    • US11306000
    • 2005-12-16
    • Seungyoon Peter SongJohn Gregory FavorRichard W. Thaik
    • Seungyoon Peter SongJohn Gregory FavorRichard W. Thaik
    • G06F9/00
    • G06F9/3846G06F9/3848
    • Software hints embedded in branch instructions direct selection of one of a plurality of branch predictors to use when processing the branch instructions, leading to improved branch prediction (i.e. fewer mis-predictions) over conventional schemes. A software agent assembles branch instructions having associated respective branch predictor control fields compatible with a branch predictor selector and a plurality of branch predictors. Each branch predictor control field is used to perform branch predictor selection, branch predictor control, or both. Branch predictor selection enables selective branch prediction according to an appropriate one of the branch predictors as determined by the software agent by examining context surrounding the branch instruction. Branch predictor control enables control of operation of one or more of the branch predictors. For example, a history-based branch predictor may be instructed to provide branch prediction according to a history-depth specified by the branch predictor control.
    • 嵌入分支指令中的软件提示直接选择在处理分支指令时使用的多个分支预测器中的一个,导致与常规方案相比改进的分支预测(即较少的误预测)。 软件代理装配具有与分支预测器选择器和多个分支预测器兼容的相关联的相应分支预测器控制字段的分支指令。 每个分支预测器控制字段用于执行分支预测器选择,分支预测器控制或两者。 分支预测器选择通过检查分支指令周围的上下文,根据由软件代理确定的适当的一个分支预测器启用选择性分支预测。 分支预测器控制使得能够控制一个或多个分支预测器的操作。 例如,可以指示基于历史的分支预测器,以根据由分支预测器控制指定的历史深度来提供分支预测。
    • 10. 发明授权
    • Flag management in processors enabled for speculative execution of micro-operation traces
    • 处理器中的标志管理能够推测微操作轨迹的执行
    • US07587585B1
    • 2009-09-08
    • US11553453
    • 2006-10-26
    • John Gregory FavorSeungyoon Peter SongChristopher P. Nelson
    • John Gregory FavorSeungyoon Peter SongChristopher P. Nelson
    • G06F9/30
    • G06F9/3842G06F9/30094G06F9/3808G06F9/3863
    • Managing speculative execution via groups of one or more actions corresponding to atomic traces enables efficient processing of flag-related actions, as atomic traces advantageously enable single checkpoints of flag values at atomic trace boundaries. Checkpointing flags during atomic trace renaming in a processor system uses a flag checkpoint table to store a plurality of flag checkpoints, each corresponding to an atomic trace. The table is selectively accessed to provide flag information to restore speculative flags when an atomic trace is aborted. A corresponding flag checkpoint is stored when an atomic trace is renamed. An action that updates flags updates all entries in the table corresponding to younger atomic traces. If the atomic trace is aborted, then the corresponding flag checkpoint is used for restoration of flag state.
    • 通过与原子轨迹对应的一个或多个动作的组来管理推测性执行,可以有效地处理与标志相关的动作,因为原子轨迹有利地使原子轨迹边界上的标志值的检查点成为可能。 在处理器系统中的原子轨迹重命名期间的检查点标志使用标志检查点表来存储多个标志检查点,每个对应于原子轨迹。 当原子轨迹中止时,有选择地访问该表以提供标志信息来恢复推测标志。 当重新命名原子轨迹时,存储对应的标志检查点。 更新标志的操作会更新表中对应于较年轻原子轨迹的所有条目。 如果原子轨迹中止,则对应的标志检查点用于恢复标志状态。