【摘要】 用完全数据关联图 CDG来表述软件管道化问题 ,图中有向边表示循环中各指令间的关联性 .同时提出了基础集的概念 ,平行可扩展的基础集可以覆盖循环的所有指令 ,文中用遗传算法来搜索基础集的最优解或次最优解 .这种方法可以处理所有可能的数据关联性 ,从而可以将循环高度并行化 .更多还原

【Abstract】 We introduce complete data dependence graph CDG, directed edges in the graph represent dependences between instructions in loop, also introduce the notation of base set ,a base set which is parallel expendable can cover the whole instructions in loop, this paper employ a genetic algorithm to search for the optimal solution of base set. This method can handle any possible data dependence, so it can high parallel the loops.更多还原