专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明申请

US20090216956A1 SYSTEM, METHOD AND COMPUTER PROGRAM PRODUCT FOR ENHANCING TIMELINESS OF CACHE PREFETCHING 有权
标题翻译：系统，方法和计算机程序产品，用于增强缓存时间的推广
公开(公告)号：US20090216956A1
公开(公告)日：2009-08-27
申请号：US12036476
申请日：2008-02-25
申请人： Kattamuri Ekanadham , Jennifer A. Navarro , Il Park , Chung-Lung Kevin Shum
发明人： Kattamuri Ekanadham , Jennifer A. Navarro , Il Park , Chung-Lung Kevin Shum
IPC分类号： G06F12/08
CPC分类号： G06F12/0862 , G06F2212/6026
摘要： A system, method, and computer program product for enhancing timeliness of cache memory prefetching in a processing system are provided. The system includes a stride pattern detector to detect a stride pattern for a stride size in an amount of bytes as a difference between successive cache accesses. The system also includes a confidence counter. The system further includes eager prefetching control logic for performing a method when the stride size is less than a cache line size. The method includes adjusting the confidence counter in response to the stride pattern detector detecting the stride pattern, comparing the confidence counter to a confidence threshold, and requesting a cache prefetch in response to the confidence counter reaching the confidence threshold. The system may also include selection logic to select between the eager prefetching control logic and standard stride prefetching control logic.
摘要翻译：提供了一种用于增强处理系统中的高速缓存存储器预取的及时性的系统，方法和计算机程序产品。系统包括步幅图案检测器，用于检测作为连续高速缓存访问之间的差异的字节量的步幅大小的步幅图案。系统还包括置信柜台。该系统还包括用于当步幅大小小于高速缓存行大小时执行方法的迫切预取控制逻辑。该方法包括响应于步幅模式检测器检测步幅模式来调整置信计数器，将置信计数器与置信阈值进行比较，以及响应于达到置信阈值的置信度计数器请求高速缓存预取。系统还可以包括选择逻辑以在急切预取控制逻辑和标准步幅预取控制逻辑之间进行选择。

2. 发明授权

US08285941B2 Enhancing timeliness of cache prefetching 有权
标题翻译：提高缓存预取的及时性
公开(公告)号：US08285941B2
公开(公告)日：2012-10-09
申请号：US12036476
申请日：2008-02-25
申请人： Kattamuri Ekanadham , Jennifer A. Navarro , Il Park , Chung-Lung Kevin Shum
发明人： Kattamuri Ekanadham , Jennifer A. Navarro , Il Park , Chung-Lung Kevin Shum
IPC分类号： G06F12/06
CPC分类号： G06F12/0862 , G06F2212/6026
摘要： A system, method, and computer program product for enhancing timeliness of cache memory prefetching in a processing system are provided. The system includes a stride pattern detector to detect a stride pattern for a stride size in an amount of bytes as a difference between successive cache accesses. The system also includes a confidence counter. The system further includes eager prefetching control logic for performing a method when the stride size is less than a cache line size. The method includes adjusting the confidence counter in response to the stride pattern detector detecting the stride pattern, comparing the confidence counter to a confidence threshold, and requesting a cache prefetch in response to the confidence counter reaching the confidence threshold. The system may also include selection logic to select between the eager prefetching control logic and standard stride prefetching control logic.
摘要翻译：提供了一种用于增强处理系统中的高速缓存存储器预取的及时性的系统，方法和计算机程序产品。系统包括步幅图案检测器，用于检测作为连续高速缓存访问之间的差异的字节量的步幅大小的步幅图案。系统还包括置信柜台。该系统还包括用于当步幅大小小于高速缓存行大小时执行方法的迫切预取控制逻辑。该方法包括响应于步幅模式检测器检测步幅模式来调整置信计数器，将置信计数器与置信阈值进行比较，以及响应于达到置信阈值的置信度计数器请求高速缓存预取。系统还可以包括选择逻辑以在急切预取控制逻辑和标准步幅预取控制逻辑之间进行选择。

3. 发明申请

US20110314259A1 OPERATING A STACK OF INFORMATION IN AN INFORMATION HANDLING SYSTEM 有权
标题翻译：在信息处理系统中操作信息堆栈
公开(公告)号：US20110314259A1
公开(公告)日：2011-12-22
申请号：US12817609
申请日：2010-06-17
申请人： Kattamuri Ekanadham , Brian R. Konigsburg , David S. Levitan , Jose E. Moreira , David Mui , IL Park
发明人： Kattamuri Ekanadham , Brian R. Konigsburg , David S. Levitan , Jose E. Moreira , David Mui , IL Park
IPC分类号： G06F9/30
CPC分类号： G06F9/30 , G06F9/30134 , G06F9/30163 , G06F9/3861
摘要： A pointer is for pointing to a next-to-read location within a stack of information. For pushing information onto the stack: a value is saved of the pointer, which points to a first location within the stack as being the next-to-read location; the pointer is updated so that it points to a second location within the stack as being the next-to-read location; and the information is written for storage at the second location. For popping the information from the stack: in response to the pointer, the information is read from the second location as the next-to-read location; and the pointer is restored to equal the saved value so that it points to the first location as being the next-to-read location.
摘要翻译：一个指针用于指向一堆信息中的下一个读取位置。将信息推送到堆栈中：保存指针的值，该指针指向堆栈内的第一个位置作为下一个读取位置; 指针被更新，使得它指向堆栈内的第二位置作为下一个读取位置; 并且将信息写入第二位置处的存储。为了从堆栈弹出信息：响应于指针，从第二位置读取信息作为下一个读取位置; 并且指针被恢复为等于保存的值，使得其指向作为下一个读取位置的第一位置。

4. 发明申请

US20110138101A1 MAINTAINING DATA COHERENCE BY USING DATA DOMAINS 失效
标题翻译：通过使用数据域维护数据的一致性
公开(公告)号：US20110138101A1
公开(公告)日：2011-06-09
申请号：US12633428
申请日：2009-12-08
申请人： Kattamuri Ekanadham , Il Park , Pratap Pattnaik
发明人： Kattamuri Ekanadham , Il Park , Pratap Pattnaik
IPC分类号： G06F12/06
CPC分类号： G06F9/30007 , G06F12/0817 , G06F12/1027
摘要： A method, system and computer program product are disclosed for maintaining data coherence, for use in a multi-node processing system where each of the nodes includes one or more components. In one embodiment, the method comprises establishing a data domain, assigning a group of the components to the data domain, sending a coherence message from a first component of the processing system to a second component of the processing system, and determining if that second component is assigned to the data domain. In this embodiment, if that second component is assigned to the data domain, the coherence message is transferred to all of the components assigned to the data domain to maintain data coherency among those components. In an embodiment, if that second component is assigned to the data domain, the first component is assigned to the data domain.
摘要翻译：公开了用于维持数据一致性的方法，系统和计算机程序产品，用于多节点处理系统，其中每个节点包括一个或多个组件。在一个实施例中，该方法包括建立数据域，将一组组件分配给数据域，将相干消息从处理系统的第一组件发送到处理系统的第二组件，以及确定该第二组件被分配给数据域。在该实施例中，如果该第二组件被分配给数据域，则将相干消息传送到分配给数据域的所有组件，以维持这些组件之间的数据一致性。在一个实施例中，如果将该第二组件分配给数据域，则将第一组件分配给数据域。

5. 发明申请

US20110238962A1 Register Checkpointing for Speculative Modes of Execution in Out-of-Order Processors 审中-公开
标题翻译：在无序处理器中注册执行的投机模式的注册点
公开(公告)号：US20110238962A1
公开(公告)日：2011-09-29
申请号：US12729282
申请日：2010-03-23
申请人： Harold W. Cain, III , Kattamuri Ekanadham , IL Park
发明人： Harold W. Cain, III , Kattamuri Ekanadham , IL Park
IPC分类号： G06F9/30
CPC分类号： G06F9/384 , G06F9/3842 , G06F9/3863
摘要： A mechanism is provided for generating a checkpoint for a speculatively executed portion of code. The mechanisms identify, during a speculative execution of a portion of code, a register renaming operation occurring to an entry in a register renaming table of the processor. In response to the register renaming operation occurring to the register renaming table, a determination is made as to whether an update to an entry in a hardware-implemented recovery renaming table is to be performed. If so, the entry in the hardware-implemented recovery renaming table is updated. The entry in the recovery renaming table is part of the checkpoint for the speculative execution of the portion of code.
摘要翻译：提供了一种用于生成用于推测性地执行的代码部分的检查点的机制。机构在推测执行代码的一部分期间识别发生在处理器的寄存器重命名表中的条目的寄存器重命名操作。响应于对寄存器重命名表发生的寄存器重命名操作，确定是否执行对硬件实现的恢复重命名表中的条目的更新。如果是这样，则更新硬件实现的恢复重命名表中的条目。恢复重命名表中的条目是对部分代码的推测执行的检查点的一部分。

6. 发明申请

US20110138125A1 EVENT TRACKING HARDWARE 有权
标题翻译：事件跟踪硬件
公开(公告)号：US20110138125A1
公开(公告)日：2011-06-09
申请号：US12630946
申请日：2009-12-04
申请人： Kattamuri Ekanadham , Il Park
发明人： Kattamuri Ekanadham , Il Park
IPC分类号： G06F12/08
CPC分类号： G06F12/0897 , G06F11/348 , G06F12/0875 , G06F2201/88
摘要： An event tracking hardware engine having N (≧2) caches is invoked when an event of interest occurs, using a corresponding key. The engine stores, for each of the different kinds of events, a corresponding cumulative number of occurrences, by carrying out additional steps. In some instances, the additional steps include searching in the N caches for an entry for the key; if an entry for the key is found, and no overflow of the corresponding cumulative number of occurrences for the entry for the key would occur by incrementing the corresponding cumulative number of occurrences, incrementing; if the entry for the key is found, and overflow would occur, promoting the entry to a next highest cache; and if the entry for the key is not found, entering the entry for the key in a zeroth one of the caches with the corresponding cumulative number of occurrences being initialized. In other instances, the additional steps include searching in a zeroth one of the caches for an entry for the key; if an entry for the key is found in the zeroth one of the caches, and no overflow of the corresponding cumulative number of occurrences for the entry for the key would occur by incrementing the corresponding cumulative number of occurrences, incrementing; if the entry for the key is found in the zeroth one of the caches, and overflow would occur, promoting the entry from the zeroth one of the caches in which the entry exists to a next highest cache; and if the entry for the key is not found, entering the entry for the key in the zeroth one of the caches with the corresponding cumulative number of occurrences being initialized. The engine includes a plurality of caches and a corresponding plurality of control circuits.
摘要翻译：使用对应的密钥，当感兴趣的事件发生时，调用具有N（≥2）个高速缓存的事件跟踪硬件引擎。通过执行附加步骤，发动机为每种不同类型的事件存储相应的累积出现次数。在某些情况下，附加步骤包括在N个高速缓存中搜索密钥的条目; 如果找到密钥的条目，并且通过增加相应的累积出现次数而不会发生用于密钥的条目的相应累积出现次数的溢出，则递增; 如果找到密钥的条目，并发生溢出，则将条目提升到下一个最高的缓存; 并且如果没有找到密钥的条目，则在具有对应的累积出现次数被初始化的高速缓存中的第零个密码中输入密钥的条目。在其他情况下，附加步骤包括在第一个高速缓存中搜索用于密钥的条目; 如果在第一个高速缓存中找到密钥的条目，并且通过增加相应的累积出现次数将增加密钥的入口的相应累积出现次数的溢出，如果在第一个高速缓存中找到密钥的条目，并且将发生溢出，则将条目存在的高速缓存中的第一个提升到下一个最高缓存; 并且如果没有找到密钥的条目，则在具有对应的累积出现次数被初始化的第一个高速缓存中输入密钥的条目。发动机包括多个高速缓存和相应的多个控制电路。

7. 发明申请

US20080282059A1 METHOD AND APPARATUS FOR DETERMINING MEMBERSHIP IN A SET OF ITEMS IN A COMPUTER SYSTEM 审中-公开
标题翻译：用于在计算机系统中确定一组项目中的会员的方法和装置
公开(公告)号：US20080282059A1
公开(公告)日：2008-11-13
申请号：US11746269
申请日：2007-05-09
申请人： Kattamuri Ekanadham , Il Park , Pratap Chandra Pattnaik , Xiaowei Shen
发明人： Kattamuri Ekanadham , Il Park , Pratap Chandra Pattnaik , Xiaowei Shen
IPC分类号： G06F9/30
CPC分类号： G06F9/383 , G06F9/3455 , G06F9/3855
摘要： A method and apparatus for maintaining membership in a set of items to be used in a predetermined manner in a computer system. A representation of each member of the set is mapped into a number of components of a primary and secondary vector when a member is added to the set. Periodically, the primary vector is changed to the secondary vector and the secondary vector to the primary vector. When members of the set are deleted, the components of the secondary vector are changed to indicate deletion of these members after the primary vector is changed to the secondary vector. Finally, membership in the set is determined by examining the components in the primary vector, and the members in the set of items are then used in a predetermined manner in the computer system. More specifically, in a sample embodiment of the present invention, membership in the set would determine if data is to be stored or removed from cache memory in a computer system. This invention, for example, provides a low cost and high performance mechanism to phase out aging membership information in a prefeteching mechanism for caching data or instructions in a computer system.
摘要翻译：一种用于在计算机系统中以预定方式使用的一组项目中的成员资格维护的方法和装置。当成员添加到集合中时，集合的每个成员的表示形式映射到主要和次要向量的多个组件。周期地，主向量被改变为次矢量，次矢量变为主矢量。当组的成员被删除时，次要向量的组件被改变以指示在将主向量改变为次要向量之后删除这些成员。最后，通过检查主向量中的组件来确定组中的成员资格，然后在计算机系统中以预定的方式使用该组项中的成员。更具体地说，在本发明的一个示例实施例中，该集合的成员资格将确定数据是否要在计算机系统中的高速缓存存储器中被存储或移除。例如，本发明提供了一种低成本和高性能的机制，用于在用于在计算机系统中缓存数据或指令的预取机制中逐步淘汰老化成员资格信息。

8. 发明授权

US08484422B2 Maintaining data coherence by using data domains 失效
标题翻译：通过使用数据域维护数据一致性
公开(公告)号：US08484422B2
公开(公告)日：2013-07-09
申请号：US12633428
申请日：2009-12-08
申请人： Kattamuri Ekanadham , Il Park , Pratap Pattnaik
发明人： Kattamuri Ekanadham , Il Park , Pratap Pattnaik
IPC分类号： G06F12/08
CPC分类号： G06F9/30007 , G06F12/0817 , G06F12/1027
摘要： A method, system and computer program product are disclosed for maintaining data coherence, for use in a multi-node processing system where each of the nodes includes one or more components. In one embodiment, the method comprises establishing a data domain, assigning a group of the components to the data domain, sending a coherence message from a first component of the processing system to a second component of the processing system, and determining if that second component is assigned to the data domain. In this embodiment, if that second component is assigned to the data domain, the coherence message is transferred to all of the components assigned to the data domain to maintain data coherency among those components. In an embodiment, if that second component is assigned to the data domain, the first component is assigned to the data domain.
摘要翻译：公开了用于维持数据一致性的方法，系统和计算机程序产品，用于多节点处理系统，其中每个节点包括一个或多个组件。在一个实施例中，该方法包括建立数据域，将一组组件分配给数据域，将相干消息从处理系统的第一组件发送到处理系统的第二组件，以及确定该第二组件被分配给数据域。在该实施例中，如果该第二组件被分配给数据域，则将相干消息传送到分配给数据域的所有组件，以维持这些组件之间的数据一致性。在一个实施例中，如果将该第二组件分配给数据域，则将第一组件分配给数据域。

9. 发明授权

US08943299B2 Operating a stack of information in an information handling system 有权
标题翻译：在信息处理系统中操作一堆信息
公开(公告)号：US08943299B2
公开(公告)日：2015-01-27
申请号：US12817609
申请日：2010-06-17
申请人： Kattamuri Ekanadham , Brian R. Konigsburg , David S. Levitan , Jose E. Moreira , David Mui , Il Park
发明人： Kattamuri Ekanadham , Brian R. Konigsburg , David S. Levitan , Jose E. Moreira , David Mui , Il Park
IPC分类号： G06F9/30
CPC分类号： G06F9/30 , G06F9/30134 , G06F9/30163 , G06F9/3861
摘要： A pointer is for pointing to a next-to-read location within a stack of information. For pushing information onto the stack: a value is saved of the pointer, which points to a first location within the stack as being the next-to-read location; the pointer is updated so that it points to a second location within the stack as being the next-to-read location; and the information is written for storage at the second location. For popping the information from the stack: in response to the pointer, the information is read from the second location as the next-to-read location; and the pointer is restored to equal the saved value so that it points to the first location as being the next-to-read location.
摘要翻译：一个指针用于指向一堆信息中的下一个读取位置。将信息推送到堆栈中：保存指针的值，该指针指向堆栈内的第一个位置作为下一个读取位置; 指针被更新，使得它指向堆栈内的第二位置作为下一个读取位置; 并且将信息写入第二位置处的存储。为了从堆栈弹出信息：响应于指针，从第二位置读取信息作为下一个读取位置; 并且指针被恢复为等于保存的值，使得其指向作为下一个读取位置的第一位置。

10. 发明授权

US08140761B2 Event tracking hardware 有权
标题翻译：事件跟踪硬件
公开(公告)号：US08140761B2
公开(公告)日：2012-03-20
申请号：US12630946
申请日：2009-12-04
申请人： Kattamuri Ekanadham , Il Park
发明人： Kattamuri Ekanadham , Il Park
IPC分类号： G06F12/00
CPC分类号： G06F12/0897 , G06F11/348 , G06F12/0875 , G06F2201/88
摘要： An event tracking hardware engine having N (≧2) caches is invoked when an event of interest occurs, using a corresponding key. The event tracking engine stores a cumulative number of occurrences for each one of the different kinds of events, and searches in the N caches for an entry for the key. When an entry for the key is found, the engine increments the number of occurrences if no overflow of the cumulative number of occurrences would occur. However, if the incrementing would cause overflow, then instead of incrementing the cumulative number of occurrences, the engine promotes the entry for the event of interest to a next higher cache.
摘要翻译：使用对应的密钥，当感兴趣的事件发生时，调用具有N（≥2）个高速缓存的事件跟踪硬件引擎。事件跟踪引擎存储每种不同类型事件的累积发生次数，并在N个高速缓存中搜索密钥的条目。当找到密钥的条目时，如果没有发生累计发生次数的溢出，引擎会增加出现次数。然而，如果增量会导致溢出，那么引擎不会增加累积的出现次数，而是为下一个更高的缓存感兴趣的事件提升条目。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式