串行程序的并行划分算法及其正确性证明  

AN ALGORITHM FOR PARTITIONING PARALLELISM IN A SEQUENTIAL PROGRAM AND ITS CORRECTNESS PROOF

作　　者：罗昕[1] 王庆超[1] 李莲治[1] 

机构地区：[1]哈尔滨工业大学

出　　处：《宇航学报》1994年第4期35-40,共6页Journal of Astronautics

基　　金：航天基金;国家教委博士点基金

摘　　要：针对多机系统结构，本文提出了在大粒度级并行划分串行程序的算法。该算法通过识别并行循环任务以及通过确定调用上下文关系识别并行过程任务，来划分串行程序中的并行成份。该算法是对串行程序实施并行分解的基础。本文还给出了该算法的正确性证明。In accordance with architecture of the multi-processor systems, this paper puts forward an algorithm which partitions parallelism in a sequential program at largegrained level. This algorithm is the basis for decomposing parallelism in a sequential program and is implemented with recognizing parallel loop tasks and parallel procedural tasks by determining the call context. The correctness proof of the algorithm is also given in this paper.

关 键 词：并行划分 并行分解 多机系统 并行处理 

分 类 号：TP338.6[自动化与计算机技术—计算机系统结构]