Generalized Parallel Computational Schemes for Time-Consuming Global Optimization


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

This paper addresses computationally intensive global optimization problems, for solving of which the supercomputing systems with exaflops performance can be required. To overcome such computational complexity, the paper proposes the generalized parallel computational schemes, which may involve numerous efficient parallel algorithms of global optimization. The proposed schemes include various ways of multilevel decomposition of parallel computations to guarantee the computational efficiency of supercomputing systems with shared and distributed memory multiprocessors with thousands of processors to meet global optimization challenges.

About the authors

R. G. Strongin

Lobachevsky State University of Nizhni Novgorod

Author for correspondence.
Email: president@unn.ru
Russian Federation, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

V. P. Gergel

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Russian Federation, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

K. A. Barkalov

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Russian Federation, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

A. V. Sysoyev

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Russian Federation, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950


Copyright (c) 2018 Pleiades Publishing, Ltd.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies