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

1. 发明授权

US06360361B1 Field reordering to optimize cache utilization 有权
标题翻译：字段重排序以优化缓存利用率
公开(公告)号：US06360361B1
公开(公告)日：2002-03-19
申请号：US09270124
申请日：1999-03-15
申请人： James R. Larus , Robert Davidson , Trishul M. Chilimbi
发明人： James R. Larus , Robert Davidson , Trishul M. Chilimbi
IPC分类号： G06F945
CPC分类号： G06F8/4442 , G06F12/0802
摘要： Fields which are individually addressable data elements in data structures are reordered to improve the efficiency of cache line access. Temporal data regarding the referencing of such fields is obtained, and a tool is used to construct a field affinity graph of temporal access affinities between the fields. Nodes in the graph represent fields, and edges between the nodes are weighted to indicate field affinity. A first pass greedy algorithm attempts to combine high affinity fields in the same cache line or block. Constraints are used to reject invalid combinations of fields. The constraints may be provided by program analysis, programmer, or actual dynamically generated.
摘要翻译：数据结构中可单独寻址的数据元素的字段被重新排序以提高高速缓存行访问的效率。获得关于这些字段的引用的时间数据，并且使用工具来构建字段之间的时间访问亲和度的字段关联图。图中的节点表示字段，并且节点之间的边被加权以指示字段亲和度。第一遍贪婪算法尝试将高亲和度字段组合在相同的高速缓存行或块中。限制用于拒绝字段的无效组合。约束可以由程序分析，程序员或实际动态生成提供。

2. 发明授权

US06330556B1 Data structure partitioning to optimize cache utilization 有权
标题翻译：数据结构分区优化缓存利用率
公开(公告)号：US06330556B1
公开(公告)日：2001-12-11
申请号：US09270125
申请日：1999-03-15
申请人： Trishul M. Chilimbi , James R. Larus , Robert Davidson
发明人： Trishul M. Chilimbi , James R. Larus , Robert Davidson
IPC分类号： G06F1730
CPC分类号： G06F17/30339 , G06F12/0802 , Y10S707/99932
摘要： Fields which are individually addressable data elements in data structures are reordered to improve the efficiency of cache line access. Temporal data regarding the referencing of such fields is obtained, and a tool is used to construct a field affinity graph of temporal access affinities between the fields. Nodes in the graph represent fields, and edges between the nodes are weighted to indicate field affinity. A first pass greedy algorithm attempts to combine high affinity fields in the same cache line or block. Constraints are used to reject invalid combinations of fields. Data structures such as class are partitioned into heavily referenced and less heavily referenced portions. The partitioning is based on profile information about field access counts with indirect addressing used to reference the less heavily referenced partitioned class. A class co-location scheme is used to ensure that temporally correlated classes are placed near each other in cache blocks. A generational garbage collection algorithm is used to ensure that objects that are most heavily referenced are more likely to remain in cache blocks.
摘要翻译：数据结构中可单独寻址的数据元素的字段被重新排序以提高高速缓存行访问的效率。获得关于这些字段的引用的时间数据，并且使用工具来构建字段之间的时间访问亲和度的字段关联图。图中的节点表示字段，并且节点之间的边被加权以指示字段亲和度。第一遍贪婪算法尝试将高亲和度字段组合在相同的高速缓存行或块中。限制用于拒绝字段的无效组合。诸如类的数据结构被划分为严格引用和较少引用的部分。分区基于关于使用间接寻址的字段访问计数的配置文件信息，用于引用较不引用的分区类。类别同位置方案用于确保时间相关的类在缓存块中彼此靠近放置。代数垃圾收集算法用于确保被最多引用的对象更有可能保留在高速缓存块中。

3. 发明授权

US06321240B1 Data structure partitioning with garbage collection to optimize cache utilization 有权
标题翻译：数据结构分区与垃圾收集优化缓存利用率
公开(公告)号：US06321240B1
公开(公告)日：2001-11-20
申请号：US09268204
申请日：1999-03-15
申请人： Trishul M. Chilimbi , James R. Larus
发明人： Trishul M. Chilimbi , James R. Larus
IPC分类号： G06F1700
CPC分类号： G06F8/4442 , Y10S707/99943 , Y10S707/99957
摘要： Fields which are individually addressable data elements in data structures are reordered to improve the efficiency of cache line access. Temporal data regarding the referencing of such fields is obtained, and a tool is used to construct a field affinity graph of temporal access affinities between the fields. Nodes in the graph represent fields, and edges between the nodes are weighted to indicate field affinity. A first pass greedy algorithm attempts to combine high affinity fields in the same cache line or block. Constraints are used to reject invalid combinations of fields. Data structures such as class are partitioned into heavily referenced and less heavily referenced portions. The partitioning is based on profile information about field access counts with indirect addressing used to reference the less heavily referenced partitioned class. A class co-location scheme is used to ensure that temporally correlated classes are placed near each other in cache blocks. A generational garbage collection algorithm is used to ensure that objects that are most heavily referenced are more likely to remain in cache blocks.
摘要翻译：数据结构中可单独寻址的数据元素的字段被重新排序以提高高速缓存行访问的效率。获得关于这些字段的引用的时间数据，并且使用工具来构建字段之间的时间访问亲和度的字段关联图。图中的节点表示字段，并且节点之间的边被加权以指示字段亲和度。第一遍贪婪算法尝试将高亲和度字段组合在相同的高速缓存行或块中。限制用于拒绝字段的无效组合。诸如类的数据结构被划分为严格引用和较少引用的部分。分区基于关于使用间接寻址的字段访问计数的配置文件信息，用于引用较不引用的分区类。类别同位置方案用于确保时间相关的类在缓存块中彼此靠近放置。代数垃圾收集算法用于确保被最多引用的对象更有可能保留在高速缓存块中。

4. 发明授权

US06971092B1 System and method for analyzing data accesses of a trace from a computer-executable program to determine data access patterns 有权
标题翻译：用于分析来自计算机可执行程序的迹线的数据访问以确定数据访问模式的系统和方法
公开(公告)号：US06971092B1
公开(公告)日：2005-11-29
申请号：US09939172
申请日：2001-08-24
申请人： Trishul M. Chilimbi
发明人： Trishul M. Chilimbi
IPC分类号： G06F9/45
CPC分类号： G06F11/3471 , G06F11/3466 , G06F12/0862 , G06F2201/865 , G06F2201/885 , G06F2212/6024
摘要： A system and method for analyzing data accesses to determine data access patterns. Data address accesses are traced and transformed into Whole Program Streams (WPS). WPS may then be used to discover higher-level data abstractions, such as hot data streams and data flow graphs. Hot data streams provide information related to sequences of data addresses that are repeatedly accessed together. Data flow graphs indicate how hot data streams are related and include frequencies of each hot data stream following another. Hot data streams and data flow graphs may be used with pre-fetching and/or cache managers to improve program performance.
摘要翻译：用于分析数据访问以确定数据访问模式的系统和方法。跟踪数据地址访问并将其转换为全程序流（WPS）。然后可以使用WPS来发现较高级别的数据抽象，例如热数据流和数据流图。热数据流提供与一起重复访问的数据地址序列相关的信息。数据流图表示热数据流是如何相关的，并且包括每个热数据流之间的频率。热量数据流和数据流图可以与预取和/或缓存管理器一起使用以改善程序性能。

5. 发明授权

US07657876B2 System and method for using data address sequences of a program in a software development tool 失效
标题翻译：在软件开发工具中使用程序的数据地址序列的系统和方法
公开(公告)号：US07657876B2
公开(公告)日：2010-02-02
申请号：US10991160
申请日：2004-11-16
申请人： Trishul M. Chilimbi
发明人： Trishul M. Chilimbi
IPC分类号： G06F9/44
CPC分类号： G06F11/3636 , G06F11/3644
摘要： A system and method for determining where bottlenecks in a program's data accesses occur and providing information to a software developer as to why the bottlenecks occur and what may be done to correct them. A stream of data access references is analyzed to determine data access patterns (also called data access sequences). The stream is analyzed to find frequently repeated data access sequences (called hot data streams). Properties of the hot data streams are calculated and upon selection of a hot data stream are displayed in a development tool that associates lines of code with the hot data streams.
摘要翻译：一种用于确定程序数据访问中出现瓶颈的系统和方法，并向软件开发人员提供有关瓶颈出现原因以及纠正方法的信息。分析数据访问引用流以确定数据访问模式（也称为数据访问序列）。分析流以找到频繁重复的数据访问序列（称为热数据流）。计算热数据流的属性，并且在选择热数据流时显示在将代码行与热数据流相关联的开发工具中。

6. 发明授权

US06934942B1 System and method for using data address sequences of a program in a software development tool 失效
公开(公告)号：US06934942B1
公开(公告)日：2005-08-23
申请号：US09939162
申请日：2001-08-24
申请人： Trishul M. Chilimbi
发明人： Trishul M. Chilimbi
IPC分类号： G06F9/44 , G06F9/45
CPC分类号： G06F11/3636 , G06F11/3644
摘要： A system and method for determining where bottlenecks in a program's data accesses occur and providing information to a software developer as to why the bottlenecks occur and what may be done to correct them. A stream of data access references is analyzed to determine data access patterns (also called data access sequences). The stream is analyzed to find frequently repeated data access sequences (called hot data streams). Properties of the hot data streams are calculated and upon selection of a hot data stream are displayed in a development tool that associates lines of code with the hot data streams.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式