会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Instruction grouping history on fetch-side dispatch group formation
    • 指令分组历史在抓取方调度组的形成
    • US07269715B2
    • 2007-09-11
    • US11050344
    • 2005-02-03
    • Hung Qui LeDavid Stephen LevitanJohn Wesley Ward, III
    • Hung Qui LeDavid Stephen LevitanJohn Wesley Ward, III
    • G06F9/38
    • G06F9/3853G06F9/3802G06F9/382
    • An improved method, apparatus, and computer instructions for grouping instructions processed in equal sized sets. A current set of instructions is received in an instruction cache for dispatching. A determination is made as to whether any instructions in the current set of instructions are part of a group including a prior set of instructions received in the instruction cache including using a history data structure, wherein the history data structure contains data regarding instructions in the prior set of instructions. Any instructions are grouped into the group with the instruction in response to a determination that the any instructions are part of the group. Instructions in the group units are dispatched to execution using the history data structure, wherein invalid instruction dispatch groupings are avoided.
    • 一种改进的方法,装置和计算机指令,用于对在相同大小的集合中处理的指令进行分组。 在指令高速缓存中接收当前的一组指令用于调度。 确定当前指令集中的任何指令是否包括包括使用历史数据结构在指令高速缓存中接收的先前指令集的组的一部分,其中历史数据结构包含关于先前的指令的数据 一套说明 响应于确定任何指令是组的一部分,任何指令被分组到具有指令的组中。 使用历史数据结构将分组单元中的指令调度到执行,其中避免了无效指令分派分组。
    • 4. 发明授权
    • Instruction group formation and mechanism for SMT dispatch
    • SMT派遣指导小组组织和机制
    • US07237094B2
    • 2007-06-26
    • US10965143
    • 2004-10-14
    • Brian William CurranBrian R. KonigsburgHung Qui LeDavid Arnold LuickDung Quoc Nguyen
    • Brian William CurranBrian R. KonigsburgHung Qui LeDavid Arnold LuickDung Quoc Nguyen
    • G06F9/38
    • G06F9/3853G06F9/30145G06F9/382G06F9/3851G06F9/3885
    • A more efficient method of handling instructions in a computer processor, by associating resource fields with respective program instructions wherein the resource fields indicate which of the processor hardware resources are required to carry out the program instructions, calculating resource requirements for merging two or more program instructions based on their resource fields, and determining resource availability for simultaneously executing the merged program instructions based on the calculated resource requirements. Resource vectors indicative of the required resource may be encoded into the resource fields, and the resource fields decoded at a later stage to derive the resource vectors. The resource fields can be stored in the instruction cache associated with the respective program instructions. The processor may operate in a simultaneous multithreading mode with different program instructions being part of different hardware threads. When the resource availability equals or exceeds the resource requirements for a group of instructions, those instructions can be dispatched simultaneously to the hardware resources. A start bit may be inserted in one of the program instructions to define the instruction group. The hardware resources may in particular be execution units such as a fixed-point unit, a load/store unit, a floating-point unit, or a branch processing unit.
    • 通过将资源字段与相应的程序指令相关联来处理计算机处理器中的指令的更有效的方法,其中资源字段指示需要哪个处理器硬件资源来执行程序指令,计算用于合并两个或多个程序指令的资源需求 并且基于所计算的资源需求来确定用于同时执行所合并的程序指令的资源可用性。 指示所需资源的资源矢量可以被编码到资源字段中,并且在稍后阶段解码资源字段以导出资源向量。 资源字段可以存储在与相应的程序指令相关联的指令高速缓存中。 处理器可以以同时多线程模式操作,其中不同的程序指令是不同硬件线程的一部分。 当资源可用性等于或超过一组指令的资源需求时,可以将这些指令同时发送到硬件资源。 可以在程序指令之一中插入起始位以定义指令组。 硬件资源可以特别地是诸如定点单元,加载/存储单元,浮点单元或分支处理单元之类的执行单元。
    • 5. 发明授权
    • Data processing system and method for using an unique identifier to
maintain an age relationship between executing instructions
    • 用于使用唯一标识符来维护执行指令之间的年龄关系的数据处理系统和方法
    • US5805849A
    • 1998-09-08
    • US829592
    • 1997-03-31
    • Paul Joseph JordanBrian R. KonigsburgHung Qui LeSteven Wayne White
    • Paul Joseph JordanBrian R. KonigsburgHung Qui LeSteven Wayne White
    • G06F9/38
    • G06F9/3855G06F9/3836G06F9/3857
    • A data processor assigns a unique identifier to each instruction. As there are a finite number of unique identifiers, the identifiers are reused during execution of a program within the data processing system. To maintain an age relationship between instructions executing in the pipeline processor, a methodology is developed to ensure that reused identifiers are properly designated as being younger than their older but larger in magnitude, counterparts. To resolve this issue, assume that the identifier assigned to each instruction has N bits, and therefore, there are 2.sup.N identifiers to be assigned to instructions in the program. The 2.sup.N identifiers are separated into 2.sup.m banks. In addition to assigning identifiers to each instruction, an identifier assignment logic circuit within the pipeline processor provides a global signal that indicates which bank is a youngest bank from which the identifiers are assigned to a remaining portion of the pipeline processor. The global signal preconditions portions of the two identifiers being compared. Subsequently, a result of this conditioning is concatenated with a remaining portion of a selected identifier. The modification of the upper bits of the identifier maintains a relative age position for the identifiers and their associated instructions in the pipelined processor.
    • 数据处理器为每个指令分配唯一的标识符。 由于存在有限数量的唯一标识符,所以在数据处理系统内的程序执行期间重新使用标识符。 为了保持在流水线处理器中执行的指令之间的年龄关系,开发了一种方法,以确保重复使用的标识符被正确地指定为年龄小于较大的,较大的数量。 为了解决这个问题,假定分配给每个指令的标识符具有N位,因此,有2N个标识符被分配给程序中的指令。 2N个标识符分成2m个银行。 除了为每个指令分配标识符之外,流水线处理器内的标识符分配逻辑电路提供一个全局信号,其指示哪个存储体是最小的存储体,其中标识符从其被分配给流水线处理器的剩余部分。 两个标识符的全局信号前提条件部分被比较。 随后,这种调理的结果与所选标识符的剩余部分连接。 标识符的高位的修改保持流水线处理器中的标识符及其相关联的指令的相对年龄位置。