串行程序的任务DAG图构造算法  

Algorithm for Constructing Task DAGs of Serial Programs

作　　者：孙立斌[1,2] 邓蓉[1,2] 陈闳中[1,2] 

机构地区：[1]同济大学计算科学与技术系,上海201804 [2]同济大学嵌入式系统与服务计算教育部重点实验室,上海201804

出　　处：《计算机系统应用》2012年第9期119-123,共5页Computer Systems & Applications

摘　　要：任务DAG图是刻画程序中各任务间依赖关系的一种手段,DAG图上除了标有任务间的依赖关系,还记录了各任务的计算量和任务之间的通信量,这些信息共同构成了任务调度的依据,国内外有许多基于任务DAG图的调度算法研究,但通过分析串行程序的相关性来构造任务DAG图的研究却不多见.分析了串行程序中存在的数据相关性和控制相关性,就程序中的顺序,分支,循环三种基本结构进行分别讨论,提出了一种串行程序任务DAG图的构造算法.Task DAG is a mean of depicting dependency among tasks of a program. Apart from dependency between tasks, amount of computation and traffic between tasks are also reflected on DAG, All these information together provides a basis for scheduling. There are much research on scheduling base on DAG both domestic and abroad, but research on constructing task DAG based on analysis of correlation among serial program is rare. This paper focuses on analysis of data dependency and control dependency and discuss respectively on sequential, branch and loop structure, propose an algorithm for constructing task DAG of serial programs.

关 键 词：串行程序并行化 DAG图 数据相关性 控制相关性 资源相关性 

分 类 号：TP311.11[自动化与计算机技术—计算机软件与理论]