首页 | 本学科首页   官方微博 | 高级检索  
     

串行程序的任务DAG图构造算法
引用本文:孙立斌,邓蓉,陈闳中.串行程序的任务DAG图构造算法[J].计算机系统应用,2012,21(9):119-123.
作者姓名:孙立斌  邓蓉  陈闳中
作者单位:1. 同济大学 计算科学与技术系, 上海 201804
2. 同济大学 嵌入式系统与服务计算教育部重点实验室, 上海 201804
摘    要:任务DAG图是刻画程序中各任务间依赖关系的一种手段,DAG图上除了标有任务间的依赖关系,还记录了各任务的计算量和任务之间的通信量,这些信息共同构成了任务调度的依据,国内外有许多基于任务DAG图的调度算法研究,但通过分析串行程序的相关性来构造任务DAG图的研究却不多见.分析了串行程序中存在的数据相关性和控制相关性,就程序中的顺序,分支,循环三种基本结构进行分别讨论,提出了一种串行程序任务DAG图的构造算法.

关 键 词:串行程序并行化  DAG图  数据相关性  控制相关性  资源相关性
收稿时间:2012/1/17 0:00:00
修稿时间:2012/2/29 0:00:00

Algorithm for Constructing Task DAGs of Serial Programs
SUN Li-Bin,DENG Rong and CHENG Hong-Zhong.Algorithm for Constructing Task DAGs of Serial Programs[J].Computer Systems& Applications,2012,21(9):119-123.
Authors:SUN Li-Bin  DENG Rong and CHENG Hong-Zhong
Affiliation:SUN Li-Bin, DENG Rong, CHENG Hong-Zhong (Deparunent of Computer Science and Technology, Tongji University, Shanghai 201804, China) (Key Lab of Services Computing and Embedded Systems of Ministry of Education, Tongji University, Shanghai 201804, China)
Abstract: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.
Keywords:parallelization of serial programs  directed acyclic graph  data dependency  control dependency  resourcesdependency
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机系统应用》浏览原始摘要信息
点击此处可从《计算机系统应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号