会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Pipelined parallelization of multi-dimensional loops with multiple data dependencies
    • 多维循环与多个数据依赖关系的流水线并行化
    • US08146071B2
    • 2012-03-27
    • US11857211
    • 2007-09-18
    • Raul Esteban SilveraPriya Unnikrishnan
    • Raul Esteban SilveraPriya Unnikrishnan
    • G06F9/45
    • G06F8/4452G06F8/443
    • A mechanism for folding all the data dependencies in a loop into a single, conservative dependence. This mechanism leads to one pair of synchronization primitives per loop. This mechanism does not require complicated, multi-stage compile time analysis. This mechanism considers only the data dependence information in the loop. The low synchronization cost balances the loss in parallelism due to the reduced overlap between iterations. Additionally, a novel scheme is presented to implement required synchronization to enforce data dependences in a DOACROSS loop. The synchronization is based on an iteration vector, which identifies a spatial position in the iteration space of the loop. Multiple iterations executing in parallel have their own iteration vector for synchronization where they update their position in the iteration space. As no sequential updates to the synchronization variable exist, this method exploits a greater degree of parallelism.
    • 将循环中的所有数据依赖关系折叠成单个,保守依赖的机制。 这种机制导致每个循环一对同步原语。 该机制不需要复杂的多阶段编译时分析。 该机制只考虑循环中的数据依赖信息。 由于迭代之间的重叠减少,低同步成本平衡了并行性的损失。 另外,提出了一种新颖的方案来实现所需的同步以在DOACROSS循环中实现数据依赖。 同步基于迭代向量,该向量标识循环的迭代空间中的空间位置。 并行执行的多个迭代具有自己的迭代向量,用于同步,它们更新其在迭代空间中的位置。 由于不存在对同步变量的顺序更新,所以该方法利用更大程度的并行性。
    • 3. 发明申请
    • PIPELINED PARALLELIZATION OF MULTI-DIMENSIONAL LOOPS WITH MULTIPLE DATA DEPENDENCIES
    • 具有多个数据依赖关系的多维数据管道并行化
    • US20090077545A1
    • 2009-03-19
    • US11857211
    • 2007-09-18
    • Raul Esteban SilveraPriya Unnikrishnan
    • Raul Esteban SilveraPriya Unnikrishnan
    • G06F9/45
    • G06F8/4452G06F8/443
    • A mechanism for folding all the data dependencies in a loop into a single, conservative dependence. This mechanism leads to one pair of synchronization primitives per loop. This mechanism does not require complicated, multi-stage compile time analysis. This mechanism considers only the data dependence information in the loop. The low synchronization cost balances the loss in parallelism due to the reduced overlap between iterations. Additionally, a novel scheme is presented to implement required synchronization to enforce data dependences in a DOACROSS loop. The synchronization is based on an iteration vector, which identifies a spatial position in the iteration space of the loop. Multiple iterations executing in parallel have their own iteration vector for synchronization where they update their position in the iteration space. As no sequential updates to the synchronization variable exist, this method exploits a greater degree of parallelism.
    • 将循环中的所有数据依赖关系折叠成单个,保守依赖的机制。 这种机制导致每个循环一对同步原语。 该机制不需要复杂的多阶段编译时分析。 该机制只考虑循环中的数据依赖信息。 由于迭代之间的重叠减少,低同步成本平衡了并行性的损失。 另外,提出了一种新颖的方案来实现所需的同步以在DOACROSS循环中实现数据依赖。 同步基于迭代向量,该向量标识循环的迭代空间中的空间位置。 并行执行的多个迭代具有自己的迭代向量,用于同步,它们更新其在迭代空间中的位置。 由于不存在对同步变量的顺序更新,所以该方法利用更大程度的并行性。