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

11. 发明申请

US20070226453A1 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字节以对齐第一和第二矢量。

12. 发明申请

US20070192762A1 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.
摘要翻译：提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。收到输入。识别输入中的一个或多个数据重排序操作，并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作，使得每个虚拟随机播放操作形成表达式树的一部分。通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树，其中每个虚拟随机播放树是仅包含表达式树的子树虚拟随机操作。然后为一个或多个组合的虚拟随机操作生成代码。

13. 发明申请

US20070169058A1 Method and system for versioning codes based on relative alignment for single instruction multiple data units 失效
标题翻译：基于单指令多数据单元相对对齐的版本编码方法和系统
公开(公告)号：US20070169058A1
公开(公告)日：2007-07-19
申请号：US11333614
申请日：2006-01-17
申请人： Alexandre Eichenberger , Amy Wang , Peng Wu , Peng Zhao
发明人： Alexandre Eichenberger , Amy Wang , Peng Wu , Peng Zhao
IPC分类号： G06F9/45
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.
摘要翻译：一种用于为存储器系统具有对准约束的单指令多数据单元生成有效版本代码的方法和系统。该系统基于计算中涉及的数据流的相对对齐来创建多个版本的代码。该系统还分析相对比对的特征（例如编译时或运行时间），以确定代码版本化是否基于成本模型是有益的。

14. 发明申请

US20050273770A1 System and method for SIMD code generation for loops with mixed data lengths 失效
标题翻译：用于具有混合数据长度的循环的SIMD代码生成的系统和方法
公开(公告)号：US20050273770A1
公开(公告)日：2005-12-08
申请号：US10919131
申请日：2004-08-16
申请人： Alexandre Eichenberger , Kai-Ting Wang , Peng Wu
发明人： Alexandre Eichenberger , Kai-Ting Wang , Peng Wu
IPC分类号： G06F9/45
CPC分类号： G06F8/4452
摘要： A method, computer program product, and information handling system for generating loop code to execute on Single-Instruction Multiple-Datapath (SIMD) architectures, where the loop operates on datatypes having different lengths, is disclosed. Further, a preferred embodiment of the present invention includes a novel technique to efficiently realign or shift arbitrary streams to an arbitrary offset, regardless whether the alignments or offsets are known at the compile time or not. This technique enables the application of advanced alignment optimizations to runtime alignment. Length conversion operations, for packing and unpacking data values, are included in the alignment handling framework. These operations are formally defined in terms of standard SIMD instructions that are readily available on various SIMD platforms. This allows sequential loop code operating on datatypes of disparate length to be transformed (“simdized”) into optimized SIMD code through a fully automated process.
摘要翻译：公开了一种用于在单指令多数据路径（SIMD）架构上生成循环码来执行循环对具有不同长度的数据类型进行操作的方法，计算机程序产品和信息处理系统。此外，本发明的优选实施例包括一种用于有效地将任意流重新对准或将任意流移动到任意偏移的新技术，无论在编译时是否已知对准或偏移。这种技术使得可以将高级对齐优化应用于运行时对齐。用于打包和解包数据值的长度转换操作包含在对齐处理框架中。这些操作根据在各种SIMD平台上容易获得的标准SIMD指令正式定义。这允许对具有不同长度的数据类型的顺序循环代码通过完全自动化的过程进行转换（“模拟化”）成优化的SIMD代码。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式