Abstract: 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/sup 2/. 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.
Index Terms:
iterative methods; Monte Carlo methods; normal distribution; Laplace transforms; error analysis; convergence; virtual machines; boundary-value problems; multiprocessor interconnection networks; chaotic iterative process simulation; speed-independent computing; mathematical simulation; self organizing chaotic processes; asynchronous method; chaotic relaxations; delay; Monte-Carlo method; chaotic computing processes; time parameters; random variable; normal distribution; computer simulation; Dirichlet problem; Laplace equation; rectangular domain; errors; convergence
Citation:
N.M. Goubareni, "Simulation of Chaotic Iterative Processes in Speed-Independent Computing Networks," pdp, pp.0027, 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96), 1996
PURCHASE ARTICLE: $19
IEEE Xplore Subscribers
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb