Generalized Parallel Computational Schemes for Time-Consuming Global Optimization


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

R. Strongin

Lobachevsky State University of Nizhni Novgorod

编辑信件的主要联系方式.
Email: president@unn.ru
俄罗斯联邦, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

V. Gergel

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
俄罗斯联邦, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

K. Barkalov

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
俄罗斯联邦, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950

A. Sysoyev

Lobachevsky State University of Nizhni Novgorod

Email: president@unn.ru
俄罗斯联邦, pr. Gagarina 23, str. 2, Niznij Novgorod, 603950


版权所有 © Pleiades Publishing, Ltd., 2018
##common.cookie##