-
1.发明授权公开(公告)号：US08954943B2
公开(公告)日：2015-02-10
申请号：US11340452
申请日：2006-01-26
CPC分类号： G06F8/443
摘要： A method for analyzing data reordering operations in Single Issue Multiple Data source code and generating executable code therefrom is provided. Input is received. One or more data reordering operations in the input are identified and each data reordering operation in the input is abstracted into a corresponding virtual shuffle operation so that each virtual shuffle operation forms part of an expression tree. One or more virtual shuffle trees are collapsed by combining virtual shuffle operations within at least one of the one or more virtual shuffle trees to form one or more combined virtual shuffle operations, wherein each virtual shuffle tree is a subtree of the expression tree that only contains virtual shuffle operations. Then code is generated for the one or more combined virtual shuffle operations.
摘要翻译： 提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。 收到输入。 识别输入中的一个或多个数据重排序操作，并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作，使得每个虚拟随机播放操作形成表达式树的一部分。 通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树，其中每个虚拟随机播放树是仅包含表达式树的子树 虚拟随机操作。 然后为一个或多个组合的虚拟随机操作生成代码。
-
2.发明授权公开(公告)号：US08136105B2
公开(公告)日：2012-03-13
申请号：US11536990
申请日：2006-09-29
IPC分类号： G06F9/45
CPC分类号： G06F8/456
摘要： A computer program product is provided for extracting SIMD parallelism. The computer program product includes instructions for providing a stream of input code comprising basic blocks; identifying pairs of statements that are semi-isomorphic with respect to each other within a basic block; iteratively combining into packs, pairs of statements that are semi-isomorphic with respect to each other, and combining packs into combined packs; collecting packs whose statements can be scheduled together for processing; and generating SIMD instructions for each pack to provide for extracting the SIMD parallelism..
摘要翻译： 提供了一种用于提取SIMD并行性的计算机程序产品。 计算机程序产品包括用于提供包括基本块的输入代码流的指令; 识别在基本块内相对于彼此半同构的语句对; 迭代地组合成包，相对于半同构的语句对，以及将包合并成组合包; 收集包，其陈述可以一起安排处理; 并为每个包生成SIMD指令以提供SIMD并行性。
-
3.发明授权Efficient generation of SIMD code in presence of multi-threading and other false sharing conditions and in machines having memory protection support 有权在存在多线程和其他虚假共享条件的情况下以及具有存储器保护支持的机器中有效地生成SIMD代码公开(公告)号：US07730463B2
公开(公告)日：2010-06-01
申请号：US11358372
申请日：2006-02-21
IPC分类号： G06F9/45
CPC分类号： G06F9/3851 , G06F8/44
摘要： A computer implemented method, system and computer program product for automatically generating SIMD code. The method begins by analyzing data to be accessed by a targeted loop including at least one statement, where each statement has at least one memory reference, to determine if memory accesses are safe. If memory accesses are safe, the targeted loop is simdized. If not safe, it is determined if a scheme can be applied in which safety need not be guaranteed. If such a scheme can be applied, the targeted loop is simdized according to the scheme. If such a scheme cannot be applied, it is determined if padding is appropriate. If padding is appropriate, the data is padded and the targeted loop is simdized. If padding is not appropriate, non-simdized code is generated based on the targeted loop for handling boundary conditions, the targeted loop is simdized and combined with the non-simdized code.
摘要翻译： 一种用于自动生成SIMD代码的计算机实现的方法，系统和计算机程序产品。 该方法开始于分析要由目标循环访问的数据，包括至少一个语句，其中每个语句具有至少一个存储器引用，以确定存储器访问是否安全。 如果存储器访问是安全的，则对象循环被简化。 如果不安全，则确定是否可以应用不需要保证安全性的方案。 如果可以应用这种方案，则根据该方案对目标循环进行模拟。 如果不能应用这种方案，则确定填充是否合适。 如果填充是合适的，则填充数据并对目标循环进行模拟。 如果填充不合适，则基于用于处理边界条件的目标循环生成非模拟代码，目标循环被简化并与非模拟代码组合。
-
4.发明申请公开(公告)号：US20080127144A1
公开(公告)日：2008-05-29
申请号：US11536990
申请日：2006-09-29
IPC分类号： G06F9/45
CPC分类号： G06F8/456
摘要： A computer program product is provided for extracting SIMD parallelism. The computer program product includes instructions for providing a stream of input code comprising basic blocks; identifying pairs of statements that are semi-isomorphic with respect to each other within a basic block; iteratively combining into packs, pairs of statements that are semi-isomorphic with respect to each other, and combining packs into combined packs; collecting packs whose statements can be scheduled together for processing; and generating SIMD instructions for each pack to provide for extracting the SIMD parallelism.
摘要翻译： 提供了一种用于提取SIMD并行性的计算机程序产品。 计算机程序产品包括用于提供包括基本块的输入代码流的指令; 识别在基本块内相对于彼此半同构的语句对; 迭代地组合成包，相对于半同构的语句对，以及将包合并成组合包; 收集包，其陈述可以一起安排处理; 并为每个包生成SIMD指令以提供SIMD并行性。
-
5.发明申请Code generation for complex arithmetic reduction for architectures lacking cross data-path support 有权针对缺乏跨数据路径支持的架构的复杂算术减少的代码生成公开(公告)号：US20080092124A1
公开(公告)日：2008-04-17
申请号：US11548851
申请日：2006-10-12
IPC分类号： G06F9/45
摘要： A computer implemented method, apparatus, and computer usable program code for compiling source code for performing a complex operation followed by a complex reduction operation. A method is determined for generating executable code for performing the complex operation and the complex reduction operation. Executable code is generated for computing sub-products, reducing the sub-products to intermediate results, and summing the intermediate results to generate a final result in response to a determination that a reduced single instruction multiple data method is appropriate.
摘要翻译： 一种计算机实现的方法，装置和计算机可用程序代码，用于编译用于执行复杂操作的复杂缩减操作的源代码。 确定用于生成用于执行复杂操作和复合缩减操作的可执行代码的方法。 生成用于计算子产品的可执行代码，将子产品减少到中间结果，并且对中间结果求和以响应于减少的单指令多数据方法的确定而产生最终结果。
-
6.发明授权Method and system for versioning codes based on relative alignment for single instruction multiple data units 失效基于单指令多数据单元相对对齐的版本编码方法和系统公开(公告)号：US07673284B2
公开(公告)日：2010-03-02
申请号：US11333614
申请日：2006-01-17
CPC分类号： G06F8/49
摘要： A method and system for generating efficient versioned codes for single instruction multiple data units whose memory systems have alignment constraints. The system creates multiple versions of codes based on relative alignments of the data streams involved in the computation. The system also analyzes characteristics of relative alignments (e.g. compile-time or runtime) to determine whether code versioning is beneficial based on a cost model.
摘要翻译： 一种用于为存储器系统具有对准约束的单指令多数据单元生成有效版本代码的方法和系统。 该系统基于计算中涉及的数据流的相对对齐来创建多个版本的代码。 系统还分析相对比对的特征（例如编译时或运行时），以确定代码版本化是否基于成本模型是有益的。
-
公开(公告)号：US20080127059A1
公开(公告)日：2008-05-29
申请号：US11535181
申请日：2006-09-26
申请人： Alexandre E. Eichenberger , Amy K. Wang , Peng Wu , Peng Zhao
发明人： Alexandre E. Eichenberger , Amy K. Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/44
摘要： A method for generating code, including identifying at least one portion of source code that is simdizable and has a dependence, analyzing the dependence for characteristics, based upon the characteristics, selecting a transformation from a predefined group of transformations, applying the transformation to the at least one portion to generate SIMD code for the at least one portion.
摘要翻译： 一种用于生成代码的方法，包括识别可仿真并具有依赖性的源代码的至少一部分，基于特征来分析对特征的依赖性，从预定义的变换组中选择变换，将转换应用于 至少一个部分，用于为所述至少一个部分生成SIMD代码。
-
8.发明授权公开(公告)号：US08037464B2
公开(公告)日：2011-10-11
申请号：US11535181
申请日：2006-09-26
申请人： Alexandre E. Eichenberger , Amy K. Wang , Peng Wu , Peng Zhao
发明人： Alexandre E. Eichenberger , Amy K. Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/45
摘要： A method for generating code, including identifying at least one portion of source code that is simdizable and has a dependence, analyzing the dependence for characteristics, based upon the characteristics, selecting a transformation from a predefined group of transformations, applying the transformation to the at least one portion to generate SIMD code for the at least one portion.
摘要翻译： 一种用于生成代码的方法，包括识别可仿真并具有依赖性的源代码的至少一部分，基于特征来分析对特征的依赖性，从预定义的变换组中选择变换，将转换应用于 至少一个部分，用于为所述至少一个部分生成SIMD代码。
-
9.发明申请Method for improving processing of relatively aligned memory references for increased reuse opportunities 审中-公开用于改善相对一致的存储器引用的处理以增加再利用机会的方法公开(公告)号：US20070226453A1
公开(公告)日：2007-09-27
申请号：US11387218
申请日：2006-03-23
申请人： Alexandre Eichenberger , Rohini Nair , Kai-Ting Wang , Peng Wu , Peng Zhao
发明人： Alexandre Eichenberger , Rohini Nair , Kai-Ting Wang , Peng Wu , Peng Zhao
IPC分类号： G06F15/00
CPC分类号： G06F9/3885 , G06F9/30036 , G06F9/345 , G06F9/383
摘要： Computer implemented method, system and computer program product for aligning vectors to be processed by SIMD code. A pair of vectors to be aligned at runtime and having a known relative alignment at compile time is identified. A modified second memory reference is generated by modifying an address of the second memory reference to be in a same congruence class as the first memory reference, wherein the congruence class is mod V and wherein V is SIMD byte width. A first SIMD load located at the modified second memory reference and a next adjacent SIMD load located at a third memory reference corresponding to the modified second memory reference address plus V are loaded, and the first SIMD load and the next adjacent SIMD load are concatenated to generate a resultant vector of length 2V. The resultant vector is left shifted by an amount corresponding to a difference between the addresses of the first memory reference and the second memory reference mod V, and the leftmost V bytes of the resultant vector are retained to align the first and second vectors.
摘要翻译： 计算机实现的方法，系统和计算机程序产品，用于对齐由SIMD代码处理的向量。 识别在运行时对准并且在编译时具有已知的相对对准的一对向量。 通过将第二存储器引用的地址修改为与第一存储器引用相同的一致类来生成修改的第二存储器引用，其中，同余类是mod V，并且其中V是SIMD字节宽度。 位于修改的第二存储器基准的第一SIMD负载和位于与修改的第二存储器参考地址加V相对应的第三存储器引用的下一相邻SIMD负载被加载，并且第一SIMD负载和下一相邻SIMD负载被级联到 产生长度为2V的合成矢量。 将所得到的矢量移位一个与第一存储器参考和第二存储器参考模V的地址之间的差相对应的量，并且保留所得到的矢量的最左侧的V字节以对齐第一和第二矢量。
-
10.发明申请Method to analyze and reduce number of data reordering operations in SIMD code 有权在SIMD代码中分析和减少数据重排序操作的方法公开(公告)号：US20070192762A1
公开(公告)日：2007-08-16
申请号：US11340452
申请日：2006-01-26
申请人： Alexandre Eichenberger , Kai-Ting Wang , Peng Wu , Peng Zhao
发明人： Alexandre Eichenberger , Kai-Ting Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/45
CPC分类号： G06F8/443
摘要： A method for analyzing data reordering operations in Single Issue Multiple Data source code and generating executable code therefrom is provided. Input is received. One or more data reordering operations in the input are identified and each data reordering operation in the input is abstracted into a corresponding virtual shuffle operation so that each virtual shuffle operation forms part of an expression tree. One or more virtual shuffle trees are collapsed by combining virtual shuffle operations within at least one of the one or more virtual shuffle trees to form one or more combined virtual shuffle operations, wherein each virtual shuffle tree is a subtree of the expression tree that only contains virtual shuffle operations. Then code is generated for the one or more combined virtual shuffle operations.
摘要翻译： 提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。 收到输入。 识别输入中的一个或多个数据重排序操作，并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作，使得每个虚拟随机播放操作形成表达式树的一部分。 通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树，其中每个虚拟随机播放树是仅包含表达式树的子树 虚拟随机操作。 然后为一个或多个组合的虚拟随机操作生成代码。
-
-
-
-
-
-
-
-
-
搜索结果
87 条记录 (耗时 0.026 秒)
