ПРОБЛЕМЫ РАСПАРАЛЛЕЛИВАНИЯ МНОГОШАГОВЫХ АЛГОРИТМОВ ТИПА АДАМСА

Abstract

The work is dedicated to the problems of parallelism multistep algorithms, made for the numerical solution of usual systems of differential equations and researching possibilities of their reflection on the modem calculating multiprocessor systems. Such way ofdesiding this problem can be effectively used in the modeling of complicated dynamic systems with concentrated parameters and will allow considerably decrease the time of decision, so that the time of modeling too. The offered algorithms are made for using in multiprocessors calculating systems SIMD type with topology structures ID- and 2D- torus. Here with supposes, that every processors element can do any arithmetic operation, the time expenditures, connected with the calling to memorizing device, are absent. For the estimations of mentioned above algorithms the more widespread criterions are used: the acceleration coefficient and the effectiveness.