会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • EXECUTION ENGINE MONITORING DEVICE AND METHOD THEREOF
    • 执行发动机监控装置及其方法
    • US20080141008A1
    • 2008-06-12
    • US11608700
    • 2006-12-08
    • Benjamin T. SanderMichael Edward TuukRavindra N. Bhargava
    • Benjamin T. SanderMichael Edward TuukRavindra N. Bhargava
    • G06F9/312
    • G06F9/30043
    • In accordance with a specific embodiment of the present disclosure, hardware periodically monitors a fetch cycle that fetches data associated with an address to determine performance parameters associated with the fetch cycle. Information related to the duration of a fetch cycle is maintained as well as information indicating the occurrence of various states and data values related to the fetch cycle. For example, the virtual address being processed during the fetch cycle is saved at the integrated circuit containing the fetch engine. Other performance-related parameters associated with execution of instructions at an execution engine of the pipeline are also monitored periodically. However, monitoring performance of the fetch engine is decoupled from monitoring performance-related events of the execution engine.
    • 根据本公开的具体实施例,硬件周期性地监视取出周期,其获取与地址相关联的数据,以确定与获取周期相关联的性能参数。 与获取周期的持续时间相关的信息被保持,以及指示与获取周期相关的各种状态和数据值的发生的信息。 例如,在读取周期期间正在处理的虚拟地址被保存在包含提取引擎的集成电路中。 与流水线的执行引擎上的指令执行相关联的其他与性能相关的参数也被周期性地监视。 然而,提取引擎的监视性能与监视与执行引擎的性能相关的事件分离。
    • 3. 发明申请
    • INSTRUCTION PIPELINE MONITORING DEVICE AND METHOD THEREOF
    • 指导管道监测装置及其方法
    • US20080141002A1
    • 2008-06-12
    • US11608697
    • 2006-12-08
    • Ravindra N. BhargavaBenjamin T. Sander
    • Ravindra N. BhargavaBenjamin T. Sander
    • G06F9/38
    • G06F12/1036G06F9/3867G06F11/3476G06F11/348G06F2201/86G06F2212/681
    • In accordance with a specific embodiment of the present disclosure, hardware periodically monitors a fetch cycle that fetches data associated with an address to determine performance parameters associated with the fetch cycle. Information related to the duration of a fetch cycle is maintained as well as information indicating the occurrence of various states and data values related to the fetch cycle. For example, the virtual address being processed during the fetch cycle is saved at the integrated circuit containing the fetch engine. Other performance-related parameters associated with execution of instructions at an execution engine of the pipeline are also monitored periodically. However, monitoring performance of the fetch engine is decoupled from monitoring performance-related events of the execution engine.
    • 根据本公开的具体实施例,硬件周期性地监视取出周期,其获取与地址相关联的数据,以确定与获取周期相关联的性能参数。 与获取周期的持续时间相关的信息被保持,以及指示与获取周期相关的各种状态和数据值的发生的信息。 例如,在读取周期期间正在处理的虚拟地址被保存在包含提取引擎的集成电路中。 与流水线的执行引擎上的指令执行相关联的其他与性能相关的参数也被周期性地监视。 然而,提取引擎的监视性能与监视与执行引擎的性能相关的事件分离。
    • 4. 发明授权
    • System and method for scheduling operations using speculative data operands
    • 使用推测数据操作数调度操作的系统和方法
    • US07937569B1
    • 2011-05-03
    • US10839471
    • 2004-05-05
    • Benjamin T. SanderBrian D. McMinn
    • Benjamin T. SanderBrian D. McMinn
    • G06F9/30
    • G06F9/3826G06F9/3834G06F9/3838G06F9/384G06F9/3842G06F9/3855G06F9/3857G06F9/3861
    • A system and method for scheduling operations using speculative data operands. In one embodiment, a system may include a scheduler configured to store a speculative source tag and a non-speculative source tag for an operand of an operation and an execution core configured to execute operations issued by the scheduler and to output result tags identifying operands generated by executing the operations. The scheduler may be configured to determine whether the operation is ready to issue by comparing the speculative source tag, but not the non-speculative source tag, to the result tags output by the execution core unless an incorrect speculation has been detected. If an incorrect speculation has been detected, the scheduler may be configured to determine whether the operation is ready to issue by comparing the non-speculative source tag, but not the speculative source tag, to the result tags output by the execution core.
    • 一种用于使用推测数据操作数调度操作的系统和方法。 在一个实施例中,系统可以包括调度器,其被配置为存储用于操作的操作数的推测源标签和非推测性源标签,以及被配置为执行由调度器发出的操作的执行核心,并输出标识所生成的操作数的结果标签 通过执行操作。 调度器可以被配置为通过将推测源标签而不是非推测性源标签与执行核心输出的结果标签进行比较来确定操作是否准备好发布,除非检测到不正确的猜测。 如果检测到不正确的猜测,则调度器可以被配置为通过将非推测性源标签而不是推测源标签与执行核心输出的结果标签进行比较来确定操作是否准备发布。
    • 7. 发明授权
    • Apparatus and method for implementing a least recently used cache replacement algorithm
    • 用于实现最近最少使用的高速缓存替换算法的装置和方法
    • US06408364B1
    • 2002-06-18
    • US09528041
    • 2000-03-17
    • Teik-Chang TanLeonel LozanoBenjamin T. Sander
    • Teik-Chang TanLeonel LozanoBenjamin T. Sander
    • G06F1200
    • G06F12/123
    • A least recently used (LRU) cache replacement algorithm is implemented with a set of N pointer registers that point to respective ways of an N-way set of memory blocks. One of the pointer registers is an LRU pointer, pointing to a least recently used way and another of the pointer registers is a most recently used (MRU) pointer, pointing to a most recently used way. For a cache fill operation in which a new memory block is written to one of the N ways, the new memory block is written into the way (wayn), pointed to by the LRU pointer. All the pointers except the MRU pointer are promoted to point to a way pointed to by respective newer neighboring pointers, the newer neighboring pointers being neighbors towards the MRU pointer. The MRU pointer is updated to point to the wayn in which the new memory block was written. For a cache hit in which one of the memory blocks in the set, waym, is accessed for a write or read operation, all the pointers waym and newer, except for the MRU pointer, are promoted to point to a way pointed to by a newer neighboring pointer. The MRU pointer is changed to point to waym. For an invalidate operation in which one of the ways, wayk is invalidated, all the pointers pointing to wayk and older are demoted, except for the LRU pointer. The LRU pointer is pointed to the invalidated way.
    • 使用指向N路存储器块集合的各个方式的一组N个指针寄存器来实现最近最少使用(LRU)高速缓存替换算法。 指针寄存器之一是LRU指针,指向最近最少使用的方式,另一个指针寄存器是最近使用的(MRU)指针,指向最近使用的方式。 对于其中将新的存储器块写入N个路径中的一个的高速缓存填充操作,新的存储器块被写入由LRU指针指向的方式(wayn)。 除了MRU指针之外的所有指针被提升以指向相应较新的相邻指针指向的方式,较新的相邻指针是朝向MRU指针的邻居。 更新MRU指针以指向写入新内存块的方式。 对于缓存命中,其中访问集合(waym)中的一个存储器块用于写入或读取操作,除了MRU指针之外,所有指向waym和更新的指针都被提升为指向一个 较新的相邻指针 MRU指针更改为指向waym。 对于无效操作,其中一种方式,wayk无效,除了LRU指针之外,所有指向wayk和old的指针都将被降级。 LRU指针指向无效的方式。
    • 8. 发明申请
    • PAIRED EXECUTION SCHEDULING OF DEPENDENT MICRO-OPERATIONS
    • 配对执行依赖性微操作
    • US20120023314A1
    • 2012-01-26
    • US12840835
    • 2010-07-21
    • Matthew M. CrumMichael D. AchenbachBetty A. McDanielBenjamin T. Sander
    • Matthew M. CrumMichael D. AchenbachBetty A. McDanielBenjamin T. Sander
    • G06F9/30G06F9/38
    • G06F9/3838G06F9/3826
    • A method and mechanism for reducing latency of a multi-cycle scheduler within a processor. A processor comprises a front end pipeline that determines data dependencies between instructions prior to a scheduling pipe stage. For each data dependency, a distance value is determined based on a number of instructions a younger dependent instruction is located from a corresponding older (in program order) instruction. When the younger dependent instruction is allocated an entry in a multi-cycle scheduler, this distance value may be used to locate an entry storing the older instruction in the scheduler. When the older instruction is picked for issue, the younger dependent instruction is marked as pre-picked. In an immediately subsequent clock cycle, the younger dependent instruction may be picked for issue, thereby reducing the latency of the multi-cycle scheduler.
    • 一种用于减少处理器内的多周期调度器的等待时间的方法和机制。 处理器包括前端流水线,其在调度管道级之前确定指令之间的数据依赖性。 对于每个数据依赖性,基于较年轻的依赖指令从相应的较旧(在程序顺序)指令中定位的指令的数量来确定距离值。 当在多循环调度器中分配较年轻的依赖指令时,该距离值可以用于定位存储在调度器中的旧指令的条目。 当较老的指令被挑选出来时,年龄较大的指令被标记为预选。 在随后的时钟周期中,可以挑选较年轻的依赖指令以进行发布,从而减少多周期调度器的等待时间。
    • 9. 发明授权
    • Scheduler for use in a microprocessor that supports data-speculative execution
    • 调度器用于支持数据推测执行的微处理器
    • US06950925B1
    • 2005-09-27
    • US10229563
    • 2002-08-28
    • Benjamin T. SanderMitchell AlsupMichael Filippo
    • Benjamin T. SanderMitchell AlsupMichael Filippo
    • G06F9/38G06F9/30
    • G06F9/3842
    • A microprocessor may include several execution units and a scheduler coupled to issue operations to at least one of the execution units. The scheduler may include several entries. A first entry may be allocated to a first operation. The first entry includes a source status indication for each of the first operation's operands. Each source status indication indicates whether a value of a respective one of the first operation's operands is speculative. The scheduler is configured to update one of the first entry's source status indications to indicate that a value of a respective one of the first operation's operands is non-speculative in response to receiving an indication that a value of a result of a second operation is non-speculative.
    • 微处理器可以包括若干个执行单元和一个调度器,它被耦合以向至少一个执行单元发出操作。 调度器可以包括几个条目。 可以将第一条目分配给第一操作。 第一个条目包括每个第一个操作的操作数的源状态指示。 每个源状态指示指示第一操作的操作数中的相应一个的值是否是推测性的。 调度器被配置为响应于接收到第二操作的结果的值不是的指示,更新第一条目的源状态指示之一以指示第一操作的操作数中的相应一个的值是非推测性的 特别的
    • 10. 发明授权
    • Method and system for speculatively invalidating lines in a cache
    • 在缓存中推测使无效行的方法和系统
    • US06725337B1
    • 2004-04-20
    • US09859290
    • 2001-05-16
    • Teik-Chung TanBenjamin T. Sander
    • Teik-Chung TanBenjamin T. Sander
    • G06F1200
    • G06F12/0891
    • A cache controller configured to speculatively invalidate a cache line may respond to an invalidating request or instruction immediately instead of waiting for error checking to complete. In case the error checking determines that the invalidation is erroneous and thus should not be performed, the cache controller protects the speculatively invalidated cache line from modification until error checking is complete. This way, if the invalidation is later found to be erroneous, the speculative invalidation can be reversed. If error checking completes without detecting any errors, the speculative invalidation becomes non-speculative.
    • 配置为推测无效高速缓存行的高速缓存控制器可以立即响应无效请求或指令,而不是等待错误检查完成。 如果错误检查确定无效是错误的,因此不应该执行,则缓存控制器保护推测无效的高速缓存行不被修改,直到错误检查完成。 这样,如果后来发现无效是错误的,则可以颠倒推测无效。 如果错误检查完成而没有检测到任何错误,则推测无效将成为非投机性的。