Skip to main content
Log in

An efficient dynamic load balancing algorithm

  • Original Paper
  • Published:
Computational Mechanics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

References

  1. Tsompanakis Y, Lagaros ND, Papadrakakis M (eds) (2007) Structural optimization considering cncertainties. Taylor & Francis

  2. Park GJ, Lee TH, Lee KH, Hwang KH (2006) Robust design: an overview. AIAA J 44(1):181–191

    Article  Google Scholar 

  3. Beyer H-G, Sendhoff B (2007) Robust optimization—a comprehensive survey. Comput Methods Appl Mech Eng 196(33–34):3190–3218

    Article  MATH  MathSciNet  Google Scholar 

  4. Ritto TG, Soize C, Sampaio R (2010) Robust optimization of the rate of penetration of a drill-string using a stochastic nonlinear dynamical model. Comput Mech 45:415–427

    Article  MATH  Google Scholar 

  5. Schevenels M, Lazarov BS, Sigmund O (2011) Robust topology optimization accounting for spatially varying manufacturing errors. Comput. Methods Appl Mech Eng 200(49–52):3613–3627

    Article  MATH  Google Scholar 

  6. Youn BD, Choi KK, Du L, Gorsich D (2007) Integration of possibility-based optimization and robust design for epistemic uncertainty. J Mech Des Trans ASME 129(8):876–882

    Article  Google Scholar 

  7. Lagaros ND, Papadrakakis M (2007) Seismic design of RC structures: a critical assessment in the framework of multi-objective optimization. Earthq Eng Struct Dynam 36(12):1623–1639

    Article  Google Scholar 

  8. Farhat C, Roux F-X (1991) A method of finite element and interconnecting and its parallel solution algorithm. Int J Numer Methods Eng 32:1205–1227

    Article  MATH  Google Scholar 

  9. Farhat C, Roux F-X (1994) Implicit parallel processing in structural mechanics. Comput Mech Adv 2:1–124

    MATH  MathSciNet  Google Scholar 

  10. Charmpis DC, Papadrakakis M (2002) Enhancing the performance of the FETI method with preconditioning techniques implemented on clusters of networked computers. Comput Mech 30:12–28

    Article  MATH  Google Scholar 

  11. EC3. Eurocode 3: Design of steel structures, Part 1.1: General Rules and Rules for Buildings. European Committee for Standardisation: Brussels, Belgium, The European Standard EN 1993-1-1 (2005)

  12. Lagaros ND, Plevris V, Papadrakakis M (2005) Multi-objective design optimization using cascade evolutionary computations. Comput Methods Appl Mech Eng 194(30–33):3496–3515

    Article  MATH  Google Scholar 

  13. Coello Coello CA (2000) An updated survey of GA-based multi-objective optimization techniques. ACM Comput Surv 32(2):109–143

    Article  Google Scholar 

  14. Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput 8(2):173–195

    Article  Google Scholar 

  15. Marler RT, Arora JS (2004) Survey of multi-objective optimization methods for engineering. Struct Multidiscip Optim 26(6):369–395

    Article  MATH  MathSciNet  Google Scholar 

  16. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  17. Mitropoulou Ch, Fourkiotis Y, Lagaros ND, Karlaftis MG (2013) Metaheuristics in structural design optimization. In: Gandomi AH, Yang X-S, Talatahari S, Alavi AH (eds) Metaheuristic applications in structures and infrastructures. Elsevier, pp 79–102

  18. Zitzler E, Laumanns M, Thiele L (2001) SPEA 2: improving the strength Pareto evolutionary algorithm. In: Giannakoglou K, Tsahalis D, Periaux J, Papailou P, Fogarty T (eds) EUROGEN 2001, evolutionary methods for design, optimization and control with applications to industrial problems. Greece, Athens, pp 95–100

    Google Scholar 

  19. Hansen N, Igel C, Roth S (2005) The multi-objective variable metric evolution strategy, Part 1, IR-INI 2005–04, ISSN 094302752

  20. Talbi El-G (2009) Metaheuristics: from design to implementation. Wiley, Hoboken

    Book  Google Scholar 

  21. Lee J, Hajela P (1996) Parallel genetic algorithm implementation in multidisciplinary rotor blade design. J Aircr 33(5):962–969

    Article  Google Scholar 

  22. Coello Coello CA, Van Veldhuizen DA, Lamont GB (2002) Evolutionary algorithms for solving multi-objective problems. Kluwer Academic Publishers, Dordrecht

    Book  MATH  Google Scholar 

  23. VanVeldhuizen DA, Zydallis JB, Lamont GB (2003) Considerations in engineering parallel multiobjective evolutionary algorithms. IEEE Trans Evol Comput 7(2):144–173

    Article  Google Scholar 

  24. de Toro Negro F, Ortega J, Ros E, Mota S, Paechter B, Martín JM (2004) PSFGA: Parallel processing and evolutionary computation for multiobjective optimisation. Parallel Comput 30(5–6):721–739

    Article  Google Scholar 

  25. Wilson LA, Moore MD (2005) Cross-pollinating parallel genetic algorithms for multiobjective search and optimization. Int J Found Comput Sci 16(2):261–280

    Article  Google Scholar 

  26. Durillo JJ, Nebro AJ, Luna F, Alba E (2008) A study of master-slave approaches to parallelize NSGA-II, IPDPS Miami 2008—Proceedings of the \(22{{\rm nd}}\) IEEE International Parallel and Distributed Processing Symposium

  27. Kipouros T, Jaeggi DM, Dawes WN, Parks GT, Savill AM, Clarkson PJ (2008) Insight into high-quality aerodynamic design spaces through multi-objective optimization. Comput Model Eng Sci 37(1):1–44

    Google Scholar 

  28. Bharti S, Frecker M, Lesieutre G (2009) Optimal morphing-wing design using parallel nondominated sorting genetic algorithm II. AIAA J 47(7):1627–1634

    Article  Google Scholar 

  29. Fan S-KS, Chang J-M (2009) A parallel particle swarm optimization algorithm for multi-objective optimization problems. Eng Optim 41(7):673–697

    Article  MathSciNet  Google Scholar 

  30. Nebro AJ, Durillo JJ (2010) A study of the parallelization of the multi-objective metaheuristic MOEA/D. Lecture Notes in Computer Science, vol 6073. LNCS, pp 303–317

  31. Zhou Y, Tan Y (2011) GPU-based parallel multi-objective particle swarm optimization. Int J Artif Intell 7(11):125–141

    Google Scholar 

  32. Mezmaz M, Melab N, Kessaci Y, Lee YC, Talbi E-G, Zomaya AY, Tuyttens D (2011) A parallel bi-objective hybrid metaheuristic for energy-aware scheduling for cloud computing systems. J Parallel Distrib Comput 71(11):1497–1508

    Article  Google Scholar 

  33. Mezura-Montesa E, Coello Coello CA (2011) Constraint-handling in nature-inspired numerical optimization: past, present and future. Swarm Evol Comput 1:173–194

    Article  Google Scholar 

  34. Arias-Montano A, Coello Coello CA (2012) Multiobjective evolutionary algorithms in aeronautical and aerospace engineering. IEEE Trans Evol Comput 16(50):662–694

    Article  Google Scholar 

  35. Deb K (2000) An efficient constraint handling method for genetic algorithms. Comput Methods Appl Mech Eng 186(2–4):311–338

    Article  MATH  Google Scholar 

  36. Kramer O, Schwefel H-P (2006) On three new approaches to handle constraints within evolution strategies. Natl Comput 5(4):363–385

    Article  MATH  MathSciNet  Google Scholar 

  37. LeTallec P (1994) Domain-decomposition methods in computational mechanics. Comput Mech Adv 1:121–220

    MathSciNet  Google Scholar 

  38. Papadrakakis M (ed) (1997) Parallel Solution Methods in Computational Mechanics. John Wiley & Sons, New York

    Google Scholar 

  39. Jönsthövel TB, van Gijzen MB, MacLachlan S, Vuik C, Scarpas A (2012) Comparison of the deflated preconditioned conjugate gradient method and algebraic multigrid for composite materials. Comput Mech 50:321–333

    Article  MATH  MathSciNet  Google Scholar 

  40. Papadrakakis M, Lagaros ND, Fragakis Y (2003) Parallel computational strategies for structural optimization. Int J Numer Methods Eng 58(9):1347–1380

    Article  MATH  Google Scholar 

  41. Papadrakakis M, Stavroulakis G, Karatarakis A (2011) A new era in scientific computing: domain decomposition methods in hybrid CPU-GPU architectures. Comput Methods Appl Mech Eng 200(13–16):1490–1508

    Article  MATH  MathSciNet  Google Scholar 

  42. Bhardwaj M, Day D, Farhat C, Lesoinne M, Pierson K, Rixen D (2000) Application of the FETI method to ASCI problems: scalability results on one-thousand processors and discussion of highly heterogeneous problems. Int J Numer Methods Eng 47:513–536

    Article  MATH  Google Scholar 

  43. Papadrakakis M, Fragakis Y (2011) An integrated geometric-algebraic method for solving semi-definite problems in structural mechanics. Comput Methods Appl Mech Eng 190(49–50):6513–6532

    Google Scholar 

  44. Price KV, Storn RM, Lampinen JA (2005) Differential evolution: a practical approach to global optimization, Natural Computing Series, Springer

  45. Lagaros ND, Karlaftis MG (2011) A critical assessment of metaheuristics for scheduling emergency infrastructure inspections. Swarm Evol Comput 1(3):147–163

    Article  Google Scholar 

  46. Lagaros ND, Papadrakakis M (2012) Applied soft computing for optimum design of structures. Struct Multidiscip Optim 45:787–799

    Article  MATH  Google Scholar 

  47. Maaranen H, Miettinen K, Penttinen A (2007) On initial populations of a genetic algorithm for continuous optimization problems. J Glob Optim 37:405–436

    Google Scholar 

  48. Runarsson TP, Yao X (2000) Stochastic ranking for constrained evolutionary optimization. IEEE Trans Evol Comput 4:284–294

    Article  Google Scholar 

  49. Ponsich A, Coello Coello CA (2011) Differential Evolution performances for the solution of mixed-integer constrained process engineering problems. Appl Soft Comput J 11(1):399–409

    Article  Google Scholar 

  50. Ellingwood BR, Galambos TV, MacGregor JG, Cornell CA (1980) Development of a probability-based load criterion for American National Standard A58. National Bureau of Standards, Washington

    Google Scholar 

  51. Sharp M, Farhat C (1994) TOPDOMDEC—a totally object oriented program for visualization, domain decomposition and parallel processing. User’s manual, PGSoft and University of Colorado, Boulder, USA

Download references

Acknowledgments

This work has been supported by the European Research Council Advanced Grant “MASTER–Mastering the computational challenges in numerical modeling and optimum design of CNT reinforced composites” (ERC-2011-ADG_20110209).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nikos D. Lagaros.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lagaros, N.D. An efficient dynamic load balancing algorithm. Comput Mech 53, 59–76 (2014). https://doi.org/10.1007/s00466-013-0892-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00466-013-0892-1

Keywords

Navigation