Conveners
Section 8 - Оptimization problems and distributed computing
- Alexander Afanasiev (IITP RAS)
Oleg Iakushkin
(Saint-Petersburg State University)
7/1/14, 4:30 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
Независимые компоненты, взаимодействующие между собой при помощи комплексного управления, делают работу сложных распределенных вычислительных систем плохо масштабируемой в рамках имеющегося промежуточного коммуникационного программного обеспечения. Можно выделить две основные проблемы масштабирования таких систем: перегрузка неравноценных узлов из-за равномерного перераспределения нагрузки и...
Prof.
Alexander Afanasiev
(IITP RAS), Ms
Elena Putilina
(IITP RAS)
7/1/14, 4:50 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
The optimal trajectories continuation method implements the natural decomposition of the problem and allows us to reduce it to a sequence of modes (Cauchy problems for systems of ordinary differential equations). Each new mode is determined by the solution of special problems of mathematical programming. The problem is solved in the environment MathCloud.
Mr
Sergey Smirnov
(Institute for Information Transmission Problems of the Russian Academy of Sciences)
7/1/14, 5:10 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
Growing number of Infrastructure as a service (IaaS) providers we observe today is a direct effect of computation costs getting cheaper and of infrastructure automatization levels getting higher. Cloud services make it possible to automate more programmer's work making him more productive. It may be considered as another step in continuous process of adding more abstraction levels to a...
Mr
Vladimir Voloshinov
(Institute for Information Transmission Problems RAS)
7/1/14, 5:30 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
Heterogeneity of optimization software (solvers and interpreters of algebraic modeling languages for optimization, e.g. AMPL, GAMS etc.) and available computing infrastructure is one of reasons complicating wide practical usage of optimization models in distributed computing mode. The problem is far from completion despite an intensive work on the subject (one of the most mature is a COIN-OR...
Mr
Sergey Smirnov
(Institute for Information Transmission Problems of the Russian Academy of Sciences)
7/1/14, 5:50 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
One of the main methods for solving discrete optimization problems is branch-and-bound. A branch-and-bound algorithm consists of a systematic enumeration of all candidate solutions, where large subsets of fruitless candidates are discarded en masse, by using upper and lower estimated bounds of the quantity being optimized. One of the ways to speed up an algorithm is to parallelize it. In case...
Dr
Mikhail Posypkin
(ITTP RAS)
7/1/14, 6:10 PM
Section 8 - Оptimization problems and distributed computing
sectional reports
Many global optimization problems need huge computational resources for their resolution thus making use of HPC resources inevitable. In the talk we give a brief overview of existing approaches to parallelization of global optimization algorithms. Then we explain why traditional approaches well tested on multicore servers and computational clusters fail for such complex systems as desktop...
