会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 14. 发明申请
    • Secure Dynamically Reconfigurable Logic
    • 安全动态可重构逻辑
    • US20120005473A1
    • 2012-01-05
    • US12827726
    • 2010-06-30
    • H. Peter HofsteeJames A. KahleMichael A. Paolini
    • H. Peter HofsteeJames A. KahleMichael A. Paolini
    • G06F1/24
    • G06F21/76G06F15/7867
    • A mechanism for securely and dynamically reconfiguring reconfigurable logic is provided. A state machine within a data processing system establishes a hardware boundary to the reconfigurable logic within the data processing system thereby forming isolated reconfigurable logic. The state machine clears any prior state existing within the isolated reconfigurable logic. The state machine authenticates a new configuration to be loaded into the isolated reconfigurable logic. The state machine determines whether the authentication of the new configuration is successful. Responsive to the authentication of the new configuration being successful, the state machine loads the new configuration into the isolated reconfigurable logic. The state machine then starts operation of the isolated reconfigurable logic.
    • 提供了一种用于安全和动态地重新配置可重构逻辑的机制。 数据处理系统内的状态机为数据处理系统内的可重构逻辑建立硬件边界,从而形成隔离的可重配置逻辑。 状态机清除分离的可重新配置逻辑中存在的任何先前状态。 状态机验证要加载到隔离可重配置逻辑中的新配置。 状态机确定新配置的认证是否成功。 响应于新配置的认证成功,状态机将新配置加载到隔离的可重配置逻辑中。 状态机然后启动隔离的可重新配置逻辑的操作。
    • 15. 发明授权
    • Latency-based scheduling of instructions in a superscalar processor
    • 超标量处理器中的指令的基于延迟的调度
    • US5802386A
    • 1998-09-01
    • US751347
    • 1996-11-19
    • James A. KahleSoummya MallickRobert G. McDonald
    • James A. KahleSoummya MallickRobert G. McDonald
    • G06F9/38G06F9/34
    • G06F9/3836G06F9/384G06F9/3855
    • Instructions are efficiently scheduled for execution based on a stored identification of the first processor cycle when a result of a previous instruction required as an operand for the instruction to be scheduled will become available. Examination of stored processor cycle identifications for the operands of an instruction reveals the earliest processor cycle when the instruction may be executed. By selecting the greater of the largest stored processor cycle identification for an operand of the instruction and the earliest available processor cycle for an execution unit required to execute the instruction, the instruction is efficiently scheduled for the earliest possible execution. Latency of previous instructions in generating an operand of the instruction being scheduled is automatically accommodated.
    • 当作为要调度的指令的操作数需要的先前指令的结果将变得可用时,基于存储的第一处理器周期的标识,有效地调度执行指令。 对指令的操作数的存储处理器周期标识的检查显示指令执行时的最早处理器周期。 通过选择指令操作数的最大的存储处理器周期标识中较大的一个,以及执行指令所需的执行单元的最早的可用处理器周期,该指令被有效地调度以进行最早的执行。 自动容纳用于生成正在调度的指令的操作数的先前指令的延迟。
    • 17. 发明授权
    • Out of order instruction load and store comparison
    • 无序指令加载和存储比较
    • US5467473A
    • 1995-11-14
    • US1976
    • 1993-01-08
    • James A. KahleChin-Cheng Kau
    • James A. KahleChin-Cheng Kau
    • G06F9/38
    • G06F9/3834
    • A processing system allows for out of order instruction execution and includes at least one load/store unit for loading instructions to a register for processing by a fixed point unit, floating point unit, or the like, and store the results to memory. A load queue maintains the addresses and program numbers of the load instructions. During execution the address of the store instruction is compared to the address in the load queue of previously executed load instructions. A program counter compares the program number of the store instruction with the program number of the load instruction in the load queue. If the addresses are different, then no impermissible out of order situation exists between the load and store instructions being compared, because the data is not at the same address. If the address is the same, and the store program number is greater than the load program number, then the instructions have been executed in order (the load correctly preceded the store) and no problem exists. However, if the addresses are the same and the load instruction has been incorrectly reordered to precede the store instruction, then a reordering conflict exists and the load instructions must be re-executed.
    • 处理系统允许执行不一致的指令,并且包括至少一个加载/存储单元,用于将指令加载到寄存器以由固定点单元,浮点单元等进行处理,并将结果存储到存储器中。 加载队列维护加载指令的地址和程序号。 在执行期间,将存储指令的地址与先前执行的加载指令的加载队列中的地址进行比较。 程序计数器将存储指令的程序号与加载队列中的加载指令的程序号进行比较。 如果地址不同,那么由于数据不在相同的地址,所以在被比较的加载和存储指令之间不存在无序的情况。 如果地址相同,并且存储程序号大于加载程序号,则指令已按顺序执行(加载正确存储在存储之前),并且不存在问题。 然而,如果地址相同并且加载指令已被错误地重新排序到存储指令之前,则存在重新排序冲突,并且必须重新执行加载指令。