Abstract: Currently most of the work in the Parallel computing field is converting serial program to parallel program. A good method to solve this problem is to develop Direct Acyclic Graph corresponding to the serial program, but most of the work now is contributing to the scheduling of the DAG. This paper analyzes the parallel property of serial program and the dependence of instructions in serial program, and then proposes an algorithm of developing the Direct Acyclic Graph corresponding to serial program.

Key words: Parallel computing, DAG, Data dependence, Control dependence, Flow dependence

摘要： 目前在并行计算研究领域中很大一部分工作是将串行程序并行化，如何发掘串行程序中存在的并行性，一个好的方法就是构造其对应的并行任务（DAG）图，对并行任务图的分析，调度和最终实现并行计算的工作已经有很多人做过，但是由串行程序构造DAG图的工作相对很少。本文分析了串行程序中存在的依赖关系，并以此为依据，提出了一种由现有的串行程序或者串行解决方案构造对应的并行任务（DAG）图的算法

关键词: 并行计算, DAG, 数据依赖, 控制依赖, 流依赖