Efficiency analysis of asynchronic parallelization of randomized algorithms

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