Optimal paralleling for solving combinatorial modelling problems. V.S. Stepashko, S.M. Yefimenko

Abstract. Applying the parallel computing is one of ways for enhancement the modeling possibilities. The goals of the paper are to show the parallel computing effectiveness and possibility of providing the uniform load of all processors of the cluster. The scheme of algorithm with successive complication of structures is proposed. Test experiments of solving the problem of structural and parametrical identification on the cluster system scit-3 showed that the use of scheme of algorithm with successive complication of structures provides the uniform load of all processors of the cluster.

Keywords. GMDH combinatorial algorithm, parallel computing, cluster system, successive complication.

References.
1. Ivakhnenko A.G., Stepashko V.S.: Noise stability of modeling, Naukova Dumka, Kyiv, 1985, 216 p. (In Russian),  http://www.gmdh.net/articles/theory/zmStep.htm
2. Stepashko V.S., Yefimenko S.M., Rozenblat O.P., Chernyack A.I. On application of parallel computations in tasks of modelling on the basis of inductive approach // Problems in programming. - 2006. - ¹ 2-3. - PP. 170-176.
3.  http://cluster.icyb.kiev.ua.