Acceleration of GMDH combinatorial search with HPC clusters. O.A. Koshulko, A.I. Koshulko

Abstract. The combinatorial algorithm of the Group Method of Data Handling is a compute intensive modellCompute intensity of combinatorial algorithms of the Group Method of Data Handling (GMDH) requires to use multiprocessor computing environments in order to reduce processing time. The properties of combinatorial GMDH let us to use the concept of processing acceleration and expand capabilities of personal computer GMDH program with power of compute clusters. In order to evaluate speed optimization and effectiveness of the GMDH program that call compute cluster during its work we proposed a method of measuring model processing rate of combinatorial algorithms and a method of a priori processing time estimation.

Keywords. Combinatorial GMDH, parallel processing, processing speed. .

References.

1. Madala H.R., Ivakhnenko A.G.: Inductive Learning Algorithms for Complex Systems Modeling. – CRC Press, 1994. – 368 p.

2. Koshulko O.A., Koshulko A.I.: Adaptive parallel implementation of the Combinatorial GMDH algorithm. - Proceedings of International Workshop on Inductive Modelling 2007, September 22-26, Czech Technical University in Prague, ISBN-978-80-01-03881-9. pp. 71-77.