机构地区: 中国科学技术大学计算机科学与技术学院
出 处: 《中国科学技术大学学报》 1997年第2期164-169,共6页
摘 要: 一般任务图很难表示多重相关循环语句中不同循环迭代之间的相关关系.本文首先介绍了循环任务图的基本概念,然后说明了如何通过循环展开技术来产生复制任务图,从而把循环传递相关转换为循环独立相关。 It is very difficult for a general task graph to represent the dependency among different iterations of a nested loop. In order to transform loop carried dependency to loop independent dependency, the concept of loop task graphs is introduced first in this paper , and then the technology of loop unrolling used to generate replicated task graphs is described. Finally, an objective function used to find an optimal unrolling vector on MIMD DM models is given.
关 键 词: 并行分布计算 多重相关循环 任务调度 程序设计
领 域: [自动化与计算机技术] [自动化与计算机技术]