Domain stretching for an advanced dual-representation polyhedral loop transformation framework
    22.
    发明授权
    Domain stretching for an advanced dual-representation polyhedral loop transformation framework 失效
    领域拉伸为先进的双重表示多面体环转换框架

    公开(公告)号:US08087011B2

    公开(公告)日:2011-12-27

    申请号:US11861503

    申请日:2007-09-26

    IPC分类号: G06F9/45 G06F9/44

    CPC分类号: G06F8/452

    摘要: Mechanisms for domain stretching for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization. In addition, mechanisms are provided for stretching the domains of statements in a program loop view of the source code to thereby normalize the domains.

    摘要翻译: 提供了用于高级双重表示多面体环转换框架的域拉伸的机制。 说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。 这些代码生成转换具有重要的属性,它们不改变中间表示中的语句的程序顺序。 该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制,用于附加优化。 另外,提供了用于在源代码的程序循环视图中拉伸语句的域的机制,从而使域标准化。

    Stable transitions in the presence of conditionals for an advanced dual-representation polyhedral loop transformation framework
    23.
    发明授权
    Stable transitions in the presence of conditionals for an advanced dual-representation polyhedral loop transformation framework 失效
    在存在高级双重表示多面体循环转换框架的条件下的稳定转换

    公开(公告)号:US08056065B2

    公开(公告)日:2011-11-08

    申请号:US11861512

    申请日:2007-09-26

    IPC分类号: G06F9/45

    CPC分类号: G06F8/447

    摘要: Mechanisms for stable transitions in the presence of conditionals for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization. In addition, mechanisms are provided for ensuring code stabilization in the presence of conditions such that code bloat is not encountered during re-entrance.

    摘要翻译: 提供了在高级双重表示多面体环转换框架的条件下存在稳定转换的机制。 说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。 这些代码生成转换具有重要的属性,它们不改变中间表示中的语句的程序顺序。 该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制,用于附加优化。 此外,还提供了在存在条件的情况下确保代码稳定的机制,使得在重入期间不会遇到代码膨胀。

    System and Method for Selective Code Generation Optimization for an Advanced Dual-Representation Polyhedral Loop Transformation Framework
    25.
    发明申请
    System and Method for Selective Code Generation Optimization for an Advanced Dual-Representation Polyhedral Loop Transformation Framework 失效
    用于高级双表示多面体环转换框架的选择性代码生成优化的系统和方法

    公开(公告)号:US20090083702A1

    公开(公告)日:2009-03-26

    申请号:US11861493

    申请日:2007-09-26

    IPC分类号: G06F9/44

    CPC分类号: G06F8/4452

    摘要: A system and method for selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

    摘要翻译: 提供了一种用于高级双表示多面体环转换框架的选择性代码生成优化的系统和方法。 说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。 这些代码生成转换具有重要的属性,它们不改变中间表示中的语句的程序顺序。 该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制,用于附加优化。

    Optimized code generation targeting a high locality software cache
    26.
    发明授权
    Optimized code generation targeting a high locality software cache 失效
    针对高位置软件缓存的优化代码生成

    公开(公告)号:US08561044B2

    公开(公告)日:2013-10-15

    申请号:US12246602

    申请日:2008-10-07

    IPC分类号: G06F9/44

    CPC分类号: G06F8/4442

    摘要: Mechanisms for optimized code generation targeting a high locality software cache are provided. Original computer code is parsed to identify memory references in the original computer code. Memory references are classified as either regular memory references or irregular memory references. Regular memory references are controlled by a high locality cache mechanism. Original computer code is transformed, by a compiler, to generate transformed computer code in which the regular memory references are grouped into one or more memory reference streams, each memory reference stream having a leading memory reference, a trailing memory reference, and one or more middle memory references. Transforming of the original computer code comprises inserting, into the original computer code, instructions to execute initialization, lookup, and cleanup operations associated with the leading memory reference and trailing memory reference in a different manner from initialization, lookup, and cleanup operations for the one or more middle memory references.

    摘要翻译: 提供了针对高位置软件缓存的优化代码生成机制。 解析原始计算机代码以识别原始计算机代码中的内存引用。 内存引用被分类为常规内存引用或不规则内存引用。 常规内存引用由高位置缓存机制控制。 原始计算机代码由编译器转换以生成转换的计算机代码,其中常规存储器引用被分组成一个或多个存储器参考流,每个存储器参考流具有前导存储器引用,尾随存储器引用和一个或多个 中间内存引用。 原始计算机代码的转换包括将原始计算机代码中的指令以不同于初始化,查找和清除操作的方式与前导存储器引用和尾随存储器引用相关联的执行初始化,查找和清除操作的指令进行插入 或更多的中间内存引用。

    Selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework
    27.
    发明授权
    Selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework 失效
    高级双重表示多面体环转换框架的选择性代码生成优化

    公开(公告)号:US08087010B2

    公开(公告)日:2011-12-27

    申请号:US11861493

    申请日:2007-09-26

    IPC分类号: G06F9/45

    CPC分类号: G06F8/4452

    摘要: Mechanisms for selective code generation optimization for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization.

    摘要翻译: 提供了用于高级双重表示多面体环转换框架的选择性代码生成优化的机制。 说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。 这些代码生成转换具有重要的属性,它们不改变中间表示中的语句的程序顺序。 该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制,用于附加优化。

    System and Method for Domain Stretching for an Advanced Dual-Representation Polyhedral Loop Transformation Framework
    28.
    发明申请
    System and Method for Domain Stretching for an Advanced Dual-Representation Polyhedral Loop Transformation Framework 失效
    用于高级双表示多面体环转换框架的域拉伸的系统和方法

    公开(公告)号:US20090307673A1

    公开(公告)日:2009-12-10

    申请号:US11861503

    申请日:2007-09-26

    IPC分类号: G06F9/45

    CPC分类号: G06F8/452

    摘要: A system and method for domain stretching for an advanced dual-representation polyhedral loop transformation framework are provided. The mechanisms of the illustrative embodiments address the weaknesses of the known polyhedral loop transformation based approaches by providing mechanisms for performing code generation transformations on individual statement instances in an intermediate representation generated by the polyhedral loop transformation optimization of the source code. These code generation transformations have the important property that they do not change program order of the statements in the intermediate representation. This property allows the result of the code generation transformations to be provided back to the polyhedral loop transformation mechanisms in a program statement view, via a new re-entrance path of the illustrative embodiments, for additional optimization. In addition, mechanisms are provided for stretching the domains of statements in a program loop view of the source code to thereby normalize the domains.

    摘要翻译: 提供了一种用于高级双重表示多面体环转换框架的域拉伸的系统和方法。 说明性实施例的机制通过提供用于在通过源代码的多面体环转换优化生成的中间表示中对各个语句实例执行代码生成变换的机制来解决已知的基于多面体循环变换的方法的弱点。 这些代码生成转换具有重要的属性,它们不改变中间表示中的语句的程序顺序。 该属性允许通过示例性实施例的新的重新导入路径将代码生成转换的结果提供给程序语句视图中的多面体循环变换机制,用于附加优化。 另外,提供了用于在源代码的程序循环视图中拉伸语句的域的机制,从而使域标准化。

    System and Method to Efficiently Prefetch and Batch Compiler-Assisted Software Cache Accesses
    30.
    发明申请
    System and Method to Efficiently Prefetch and Batch Compiler-Assisted Software Cache Accesses 失效
    有效预取和批量编译器辅助软件缓存访问的系统和方法

    公开(公告)号:US20080046657A1

    公开(公告)日:2008-02-21

    申请号:US11465522

    申请日:2006-08-18

    IPC分类号: G06F12/00

    摘要: A system and method to efficiently pre-fetch and batch compiler-assisted software cache accesses are provided. The system and method reduce the overhead associated with software cache directory accesses. With the system and method, the local memory address of the cache line that stores the pre-fetched data is itself cached, such as in a register or well known location in local memory, so that a later data access does not need to perform address translation and software cache operations and can instead access the data directly from the software cache using the cached local memory address. This saves processor cycles that would otherwise be required to perform the address translation a second time when the data is to be used. Moreover, the system and method directly enable software cache accesses to be effectively decoupled from address translation in order to increase the overlap between computation and communication.

    摘要翻译: 提供了一种有效预取和批量编译器辅助的软件高速缓存访​​问的系统和方法。 系统和方法减少与软件缓存目录访问相关的开销。 使用系统和方法,存储预取数据的高速缓存行的本地存储器地址本身被缓存,例如在本地存储器中的寄存器或公知位置中,使得稍后的数据访问不需要执行地址 翻译和软件缓存操作,并且可以使用缓存的本地存储器地址直接从软件缓存访问数据。 这节省了当使用数据时第二次执行地址转换所需的处理器周期。 此外,系统和方法直接使得软件高速缓存访​​问能够有效地从地址转换中解耦,以增加计算和通信之间的重叠。