串行算法并行化处理的数学模型与算法描述  

Mathematical Models and Algorithm Description of Parallelizing Serial Algorithm

作　　者：吴越[1] 

机构地区：[1]河海大学理学院,江苏南京210098

出　　处：《计算机技术与发展》2012年第5期14-18,共5页Computer Technology and Development

摘　　要：并行计算是指同时使用多种计算资源解决计算问题的过程,节省了大量计算时间,极大地提高计算效率。目前各领域大量的串行程序已经相当成熟,所以如何通过一种转换,将现有大量的串行程序转化成并行程序,是提高程序运行速度的突破口。为了将串行程序并行化,以提高程序的运行效率,充分利用已经非常成熟的大量串行程序,文中从图论出发,建立并讨论了串行算法并行化的三个数学模型:有向带权图模型、集合划分模型、标记AVL树模型。通过这些数学模型,基于图论的思想方法,文中讨论了串行算法并行化的可行性,并提出了串行程序并行化的算法思想。Parallel computing means using a variety of computing resources to solve computational problems at the same time. It saves a lot of computing time, greatly improves the computational efficiency. Various areas of a large number of serial programs is already quite mature. So how to convert the serial programs into parallel programs is a breakthrough to improve the speed of the computational efficiency. Parallelizing serial algorithm can not only improve the operating efficiency of programs, but make full use of large number of serial programs which have been mature already. In this paper, three mathematical models of parallelizing serial algorithm were established： directed weighted graph model, the set partitioning model,marked AVL tree model, and thus discussed the feasibility and the ideas of parallelizing serial algorithm.

关 键 词：带权有向图 AVL树 并行化 串行程序 

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