会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Translating translation requests having associated priorities
    • 翻译具有相关优先级的翻译请求
    • US08966221B2
    • 2015-02-24
    • US13165013
    • 2011-06-21
    • Ute GaertnerThomas Koehler
    • Ute GaertnerThomas Koehler
    • G06F12/00G06F13/00G06F12/10G06F12/08
    • G06F12/1027G06F12/0855
    • A lookup operation is performed in a translation look aside buffer based on a first translation request as current translation request, wherein a respective absolute address is returned to a corresponding requestor for the first translation request as translation result in case of a hit. A translation engine is activated to perform at least one translation table fetch in case the current translation request does not hit an entry in the translation look aside buffer, wherein the translation engine is idle waiting for the at least one translation table fetch to return data, reporting the idle state of the translation engine as lookup under miss condition and accepting a currently pending translation request as second translation request, wherein a lookup under miss sequence is performed in the translation look aside buffer based on said second translation request.
    • 在基于第一翻译请求的翻译旁边缓冲器中执行查找操作作为当前翻译请求,其中相应的绝对地址在命中情况下作为翻译结果返回给第一翻译请求的对应请求者。 翻译引擎被激活以执行至少一个转换表提取,以防当前转换请求没有到达翻译旁边缓冲器中的条目,其中翻译引擎空闲等待至少一个转换表提取返回数据, 将所述翻译引擎的空闲状态报告为在未命中条件下的查找,并接受当前待处理的转换请求作为第二转换请求,其中在所述翻译旁边缓冲器中基于所述第二翻译请求执行在未命中序列下的查找。
    • 2. 发明授权
    • Management of both renamed and architected registers in a superscalar
computer system
    • 在超标量计算机系统中管理重命名和架构的寄存器
    • US5996063A
    • 1999-11-30
    • US815351
    • 1997-03-11
    • Ute GaertnerKlaus Jorg GetzlaffThomas KoehlerErwin Pfeffer
    • Ute GaertnerKlaus Jorg GetzlaffThomas KoehlerErwin Pfeffer
    • G06F9/30G06F9/38
    • G06F9/3012G06F9/384G06F9/3855G06F9/3863
    • The invention relates to the area of register renaming and allocation in superscalar computer systems. When a multitude of instructions in the instruction stream reads from or writes to a certain logical register, said logical register will have to be represented by a multitude of physical registers.Therefore, there have to exist several physical rename registers per logical register. The oldest one of said rename registers defines the architected state of the computer system, the in-order state.The invention provides a method for administration of the various register instances. Both the registers representing the in-order state and the various rename instances are kept in one common circular buffer. There exist two pointers per logical register: The first one, the in-order pointer, points to the register that represents the in-order state, the second one, the rename pointer, points to the most recent rename instance.
    • 本发明涉及超标量计算机系统中注册重命名和分配的领域。 当指令流中的多个指令读取或写入某个逻辑寄存器时,所述逻辑寄存器将必须由多个物理寄存器表示。 因此,每个逻辑寄存器必须存在多个物理重命名寄存器。 所述重命名寄存器中最老的一个定义了计算机系统的架构状态,即按顺序状态。 本发明提供了一种用于管理各种寄存器实例的方法。 表示按顺序状态的寄存器和各种重命名实例都保存在一个通用循环缓冲器中。 每个逻辑寄存器存在两个指针:第一个,按顺序指针指向表示按顺序状态的寄存器,第二个是重命名指针,指向最近的重命名实例。
    • 3. 发明申请
    • ADDRESS TRANSLATION, ADDRESS TRANSLATION UNIT DATA PROCESSING PROGRAM, AND COMPUTER PROGRAM PRODUCT FOR ADDRESS TRANSLATION
    • 地址翻译,地址转换单元数据处理程序和用于地址转换的计算机程序产品
    • US20110320761A1
    • 2011-12-29
    • US13165013
    • 2011-06-21
    • Ute GaertnerThomas Koehler
    • Ute GaertnerThomas Koehler
    • G06F12/10
    • G06F12/1027G06F12/0855
    • A lookup operation is performed in a translation look aside buffer based on a first translation request as current translation request, wherein a respective absolute address is returned to a corresponding requestor for the first translation request as translation result in case of a hit. A translation engine is activated to perform at least one translation table fetch in case the current translation request does not hit an entry in the translation look aside buffer, wherein the translation engine is idle waiting for the at least one translation table fetch to return data, reporting the idle state of the translation engine as lookup under miss condition and accepting a currently pending translation request as second translation request, wherein a lookup under miss sequence is performed in the translation look aside buffer based on said second translation request.
    • 在基于第一翻译请求的翻译旁边缓冲器中执行查找操作作为当前翻译请求,其中相应的绝对地址在命中情况下作为翻译结果返回给第一翻译请求的对应请求者。 翻译引擎被激活以执行至少一个转换表提取,以防当前转换请求没有到达翻译旁边缓冲器中的条目,其中翻译引擎空闲等待至少一个转换表提取返回数据, 将所述翻译引擎的空闲状态报告为在未命中条件下的查找,并接受当前待处理的转换请求作为第二转换请求,其中在所述翻译旁边缓冲器中基于所述第二翻译请求执行在未命中序列下的查找。
    • 6. 发明申请
    • Buffered Indexing to Manage Hierarchical Tables
    • 缓冲索引来管理分层表
    • US20080010407A1
    • 2008-01-10
    • US11428858
    • 2006-07-06
    • Ute GaertnerErwin F. PfefferBruce Wagar
    • Ute GaertnerErwin F. PfefferBruce Wagar
    • G06F12/00
    • G06F12/0897G06F12/0804
    • Buffered indexing for a computer's array such as a cache is used to synchronize parent entries with children and allow background invalidation (that is, suspending the invalidation should a new request of the array come in, resuming the invalidation after the request is satisfied) of the child entries. A method for synchronization uses linking of (multiple) entries in lower-level tables to single entries in a higher-level table with a buffered index value. This index value increments each time the higher-level entry is replaced or invalidated (and thus disassociated with its corresponding lower-level entries). Multiple sets of index values are maintained, so that when one set is exhausted, processing can continue with one of the other sets. All corresponding lower-level entries with index values from the old (dirty) set can then be scrubbed (invalidated) while new entries are built from the new (clean) set. Scrubbing can take place in the background, and can be suspended and resumed at any time so as to not impact request service times of the tables.
    • 用于计算机阵列的缓冲索引(例如缓存)用于将父条目与子对象同步,并允许后台无效(即,如果数组的新请求进入,则在暂停请求满足后恢复无效)来暂停无效 子项。 同步的方法使用下级表中的(多个)条目与具有缓冲索引值的更高级别表中的单个条目的链接。 每次上级条目被替换或无效时,该索引值递增(从而与其对应的较低级别条目解除关联)。 维持多组索引值,因此当一个集合耗尽时,处理可以继续其他集合之一。 然后可以从新的(干净的)集合构建新的条目,然后可以擦除(无效)来自旧(脏)集合的索引值的所有相应的较低级别条目。 擦洗可以在后台进行,可以随时暂停和恢复,以免影响表的请求服务时间。