Simulation of chaotic iterative processes in speed-independent computing networks

Mathematical simulation of self organizing chaotic processes in networks with speed independent processes by means of the asynchronous method of chaotic relaxations with delay using the Monte-Carlo method is considered. This method allows to imitate effectively the fulfilment of chaotic computing processes depending on the spread of time parameters of speed independent processors. Every speed independent processor is a nonsynchronous competing device in which the duration of the transient process is a random variable. In this work it is assumed that the random variable has normal distribution as far as the duration of work of the logical elements has namely such law of distribution. For computer simulation the Dirichlet problem was chosen for Laplace´s equation, on a rectangular domain of R². Numerical calculations for solving this problem, comparing evaluations of errors and speed of convergence of computing processes arising in networks with speed independent processors are presented