Comparative analysis of the classical and stochastic methods for the parallel iterative computations

The asynchronous approach in the iterative methodology is discussed. The comparative modeling of parallel computations according to stochastic (asynchronous) and to classical (synchronous) iterative methods are represented. Some lower and upper estimates for the time complexity of the serial and parallel algorithms are done. An unfoundedness of the habitual opinion about parallelisation advantages supposedly characteristic for stochastic iterations against to classic ones is shown.