会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • SIMD compare instruction using permute logic for distributed register files
    • SIMD比较指令使用分布式寄存器文件的置换逻辑
    • US09575753B2
    • 2017-02-21
    • US13420699
    • 2012-03-15
    • Alexandre E. EichenbergerBruce M. Fleischer
    • Alexandre E. EichenbergerBruce M. Fleischer
    • G06F9/30G06F9/38
    • G06F9/30032G06F9/30021G06F9/30036G06F9/3838
    • Mechanisms, in a data processing system comprising a single instruction multiple data (SIMD) processor, for performing a data dependency check operation on vector element values of at least two input vector registers are provided. Two calls to a simd-check instruction are performed, one with input vector registers having a first order and one with the input vector registers having a different order. The simd-check instruction performs comparisons to determine if any data dependencies are present. Results of the two calls to the simd-check instruction are obtained and used to determine if any data dependencies are present in the at least two input vector registers. Based on the results, the SIMD processor may perform various operations.
    • 提供了一种包括用于对至少两个输入向量寄存器的向量元素值进行数据相关性检查操作的单指令多数据(SIMD)处理器的数据处理系统中的机制。 执行对SIMD检查指令的两次调用,其中一个具有输入向量寄存器具有第一级,一个具有不同顺序的输入向量寄存器。 simd检查指令执行比较以确定是否存在任何数据依赖性。 获得对simd检查指令的两次调用的结果,并用于确定至少两个输入向量寄存器中是否存在任何数据依赖性。 基于该结果,SIMD处理器可以执行各种操作。
    • 10. 发明授权
    • Analyze and reduce number of data reordering operations in SIMD code
    • 分析和减少SIMD代码中数据重排序的数量
    • US08954943B2
    • 2015-02-10
    • US11340452
    • 2006-01-26
    • Alexandre E. EichenbergerKai-Ting Amy WangPeng WuPeng Zhao
    • Alexandre E. EichenbergerKai-Ting Amy WangPeng WuPeng Zhao
    • G06F9/45G06F15/00G06F15/76
    • 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.
    • 提供了一种用于分析单发多数据源代码中的数据重排序操作并从中生成可执行代码的方法。 收到输入。 识别输入中的一个或多个数据重排序操作,并将输入中的每个数据重排序操作抽象为相应的虚拟随机播放操作,使得每个虚拟随机播放操作形成表达式树的一部分。 通过将所述一个或多个虚拟随机播放树中的至少一个中的虚拟随机播放操作组合以形成一个或多个组合的虚拟随机播放操作来折叠一个或多个虚拟洗牌树,其中每个虚拟随机播放树是仅包含表达式树的子树 虚拟随机操作。 然后为一个或多个组合的虚拟随机操作生成代码。