MATEC Web Conf.
Volume 157, 2018Machine Modelling and Simulations 2017 (MMS 2017)
|Number of page(s)||10|
|Section||Modelling and simulation, structural optimization|
|Published online||14 March 2018|
Parallelization of computational algorithms for optimization problems with high time consumption
University of Žilina, Faculty of Mechanical Engineering, Department of Applied Mechanics, Univerzitná 8215/1, Žilina, Slovak Republic
2 Armed Forces Academy of General M. R. Štefánik, Department of Informatics, Liptovský Mikuláš, Slovak Republic
* Corresponding author: email@example.com
The paper presents an analysis of the use of optimization algorithms in parallel solutions and distributed computing systems. The primary goal is to use evolutionary algorithms and their implementation into parallel calculations. Parallelization of computational algorithms is suitable for the following cases - computational models with a large number of design variables or cases where the objective function evaluation is time consuming (FE analysis). As the software platform for application of distributed optimization algorithms is using MATLAB and BOINC software package.
Key words: ADINA / MATLAB / BOINC / optimization algorithms / parallelization / distributed computing systems / evolutionary algorithms / FE analysis
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (http://creativecommons.org/licenses/by/4.0/).
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.