Invention Grant
US08954943B2 Analyze and reduce number of data reordering operations in SIMD code
有权
分析和减少SIMD代码中数据重排序的数量
- Patent Title: Analyze and reduce number of data reordering operations in SIMD code
- Patent Title (中): 分析和减少SIMD代码中数据重排序的数量
-
Application No.: US11340452Application Date: 2006-01-26
-
Publication No.: US08954943B2Publication Date: 2015-02-10
- Inventor: Alexandre E. Eichenberger , Kai-Ting Amy Wang , Peng Wu , Peng Zhao
- Applicant: Alexandre E. Eichenberger , Kai-Ting Amy Wang , Peng Wu , Peng Zhao
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agency: Yee & Associates, P.C.
- Agent Ryan Lewis
- Main IPC: G06F9/45
- IPC: G06F9/45 ; G06F15/00 ; G06F15/76

Abstract:
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.
Public/Granted literature
- US20070192762A1 Method to analyze and reduce number of data reordering operations in SIMD code Public/Granted day:2007-08-16
Information query