随机算法异步并行化的效率分析  

Efficiency Analysis of Asynchronic Parallelization of Randomized Algorithms

作　　者：徐云[1] 陈国良[1] 张强峰[1] 顾钧[1] 

机构地区：[1]中国科学技术大学计算机科学与技术系,安徽合肥230027

出　　处：《软件学报》2003年第5期871-876,共6页Journal of Software

基　　金：国家重点基础研究发展规划(973));中国科学院高水平大学建设项目~~

摘　　要：随机算法的执行时间具有不确定性,这种不确定性为随机算法的异步并行提供了良好的基础,已有许多计算实验表明了随机算法的异步并行可以达到线性甚至超线性的加速.对于求解SAT问题的随机算法RDP,研究了异步并行效率与运行时间分布和处理器数目之间的关系.应用一种单峰分布──分段线性分布模型来模拟随机算法的运行时间分布.理论分析和计算结果均表明:当处理器数目k较小和单峰位于分布的前部时,随机算法的异步并行具有近线性加速.The uncertainty of running time of randomized algorithms provides a better opportunity for asynchronized parallelization. There are many computing experiments verifying that the asynchronized parallelizating acceleration of randomized algorithms are linear or even superlinear. For randomized algorithm RDP solving for SAT (satisfiability) problem, the relation among efficiency of asynchronized parallelization, distribution of running time and number of processors are investigated. A model of piecewise-linear distribution is applied to simulate the running time distribution of randomized algorithms. This model of distribution is a kind of single peak. Both theoretical analysis and computing experiment indicates that asynchronized parallelization of randomized algorithms are of near linear acceleration when the processors are less and the single peak is located near the front of running time distributions.

关 键 词：随机算法 异步并行化 效率分析 NP完全问题 

分 类 号：O22[理学—运筹学与控制论] TP301.6[理学—数学]