Generalized Parallel Computational Schemes for Time-Consuming Global Optimization


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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.

Sobre autores

R. Strongin

Lobachevsky State University of Nizhni Novgorod

Autor responsável pela correspondência
Email: president@unn.ru
Rússia, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

V. Gergel

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Rússia, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

K. Barkalov

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Rússia, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

A. Sysoyev

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
Rússia, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950


Declaração de direitos autorais © Pleiades Publishing, Ltd., 2018

Este site utiliza cookies

Ao continuar usando nosso site, você concorda com o procedimento de cookies que mantêm o site funcionando normalmente.

Informação sobre cookies