基于任务图的一种并行程序设计方法（Ⅰ）──任务图的设计  

A METHOD OF PARALLEL PROGRAM DESIGN BASED ON TASK GRAPH(Ⅰ)── DESIGN OF TASK GRAPH

作　　者：张德富[1] 吴巧泉[1] 

机构地区：[1]南京大学计算机科学系

出　　处：《软件学报》1995年第6期379-384,共6页Journal of Software

基　　金：国家863计划资助

摘　　要：本文提出一种基于任务图的并行程序设计方法．首先分析欲解的问题，产生数据流程图，并以此设计出表示并行算法的任务图，然后根据任务图选择合适的系统拓扑结构，最后完成并行程序的设计．该方法思路清晰，富有条理，产生的并行程序质量较高．This paper presents a method of parallel program design on task graph. At first, the authors can produce a dataflow chart by analyzing a given problem to get the task graph, i. e., a representation of the parallel algorithm for the problem, and then,choose the topologic structure according the task graph, at last parallel program is written in parallel programming languages. This method is lucid and most of the parallel programs designed by the method are of high quality.

关 键 词：任务图 并行程度设计 并行算法 

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