An efficient dynamic load balancing algorithm

  • Authors:

  • Nikos D. Lagaros

  • Affiliations:

  • Institute of Structural Analysis and Antiseismic Research, Department of Structural Engineering, School of Civil Engineering, National Technical University of Athens, Athens, Greece 157 80

  • Venue:
  • Computational Mechanics
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

In engineering problems, randomness and uncertainties are inherent. Robust design procedures, formulated in the framework of multi-objective optimization, have been proposed in order to take into account sources of randomness and uncertainty. These design procedures require orders of magnitude more computational effort than conventional analysis or optimum design processes since a very large number of finite element analyses is required to be dealt. It is therefore an imperative need to exploit the capabilities of computing resources in order to deal with this kind of problems. In particular, parallel computing can be implemented at the level of metaheuristic optimization, by exploiting the physical parallelization feature of the nondominated sorting evolution strategies method, as well as at the level of repeated structural analyses required for assessing the behavioural constraints and for calculating the objective functions. In this study an efficient dynamic load balancing algorithm for optimum exploitation of available computing resources is proposed and, without loss of generality, is applied for computing the desired Pareto front. In such problems the computation of the complete Pareto front with feasible designs only, constitutes a very challenging task. The proposed algorithm achieves linear speedup factors and almost 100% speedup factor values with reference to the sequential procedure.