This paper presents a communication optimization technique, named communication-free redundant computation partitioning, for parallel loop sequences.
针对并行循环套序列,提出一种冗余计算分割的通信优化方法。
This algorithm is the basis for decomposing parallelism in a sequential program and is implemented with recognizing parallel loop tasks and parallel procedural tasks by determining the call context.
该算法通过识别并行循环任务以及通过确定调用上下文关系识别并行过程任务,来划分串行程序中的并行成份。该算法是对串行程序实施并行分解的基础。
This algorithm is the basis for decomposing parallelism in a sequential program and is implemented with recognizing parallel loop tasks and parallel procedural tasks by determining the call context.
该算法通过识别并行循环任务以及通过确定调用上下文关系识别并行过程任务,来划分串行程序中的并行成份。该算法是对串行程序实施并行分解的基础。
应用推荐