Soft Computing

, Volume 21, Issue 21, pp 6351–6368 | Cite as

On asynchronous parallelization of order-based GA over grid-enabled heterogenous commodity hardware

  • José Valente de Oliveira
  • Sérgio Baltazar
  • Helder Daniel
Methodologies and Application
  • 108 Downloads

Abstract

In real-world applications, the runtime of genetic algorithms (GAs) can be computationally demanding, an issue that can be mitigated using parallelization. The study evaluates the parallelization of order-based GAs using the island model in an asynchronous heterogeneous computing environment. The island model allows for a considerable number of migration topologies. The study offers a systematic review of the studies on migration topologies and observes that no study is available yet on the performance of these migration topologies over asynchronous heterogeneous environments. Based on a statistical analysis of a comprehensive set of experiments, using real-world TSPLIB instances, the study researches the question: What is the fastest island model topology for order-based genetic algorithm, in an asynchronous distributed heterogeneous grid-enabled commodity computing environment, without losing significant fitness comparatively to the correspondent sequential panmictic implementation of the same algorithm?. Moreover, a new speedup index, the expected root speedup, is also proposed. A diversity of topology types and characteristics are considered: the single node, star, ring, cartwheel, rooted ordered tree, rooted full binary tree, coordinated tree-ring, and feedforward fully connected layered type. Different number of nodes are also considered. While some of the types of topologies are well known, the coordinated tree-ring topology is a novelty. These types of topologies allow us to assess three notable cases: (i) no migration (isolated island), (ii) migration toward the coordinator only, and (iii) migration flows to, and from, the coordinator.

Keywords

Commodity computing Expected root speedup index Genetic algorithms Island model Asynchronous hierarchical genetic algorithm Heterogeneous grid computing Globus toolkit Traveling salesman problem 

References

  1. Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evolut Comput 6(5):443–462CrossRefGoogle Scholar
  2. Alba Enrique (2005) Parallel metaheuristics: a new class of algorithms. Wiley-Interscience, New YorkCrossRefMATHGoogle Scholar
  3. Alba Enrique, Luque Gabriel, Nesmachnow Sergio (2013) Parallel metaheuristics: recent advances and new trends. Int Trans Oper Res 20(1):1–48Google Scholar
  4. Alba Enrique, Nebro Antonio J, Troya José M (2002) Heterogeneous computing and parallel genetic algorithms. J Parallel Distrib Comput 62(9):1362–1385CrossRefMATHGoogle Scholar
  5. Alba Enrique, Troya José M (1999) A survey of parallel distributed genetic algorithms. Complexity 4(4):31–52MathSciNetCrossRefGoogle Scholar
  6. Andalon-Garcia IR, Chavoya A (2012) Performance comparison of three topologies of the island model of a parallel genetic algorithm implementation on a cluster platform. In: 2012 22nd International conference on electrical communications and computers (CONIELECOMP), pp 1–6Google Scholar
  7. Applegate David L, Bixby Robert E, Chvatal Vasek, Cook William J (2007) The traveling salesman problem: a computational study (Princeton series in applied mathematics). Princeton University Press, PrincetonGoogle Scholar
  8. Arora Sanjeev (1998) Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J ACM 45(5):753–782MathSciNetCrossRefMATHGoogle Scholar
  9. Baugh JW Jr, Kumar SV (2003) Asynchronous genetic algorithms for heterogeneous networks using coarse-grained dataflow. In: Cantú-Paz E, Foster JA, Deb K, Davis LD, Roy R, O’Reilly U-M, Beyer H-G, Standish R, Kendall G, Wilson S, Harman M, Wegener J, Dasgupta D, Potter MA, Schultz AC, Dowsland KA, Jonoska N, Miller J (eds) Genetic and evolutionary computation-GECCO 2003. Lecture notes in computer science, vol 2723. Springer, Berlin, pp 730–741Google Scholar
  10. Bernabe S, Plaza A (2011) Commodity cluster-based parallel implementation of an automatic target generation process for hyperspectral image analysis. In: 2011 IEEE 17th international conference on parallel and distributed systems (ICPADS), pp 1038–1043Google Scholar
  11. Braun H (1990) On Solving Travelling Salesman Problems by Genetic Algorithms. In: 1st Workshop on parallel problem solving from nature, PPSN I, Dortmund, FRG, 1–3 Oct 1990, Proceedings, pp 129–133Google Scholar
  12. Brightwell Ron, Fisk Lee Ann, Greenberg David S, Hudson Trammell, Levenhagen Michael, Maccabe Arthur B, Riesen Rolf (2000) Massively parallel computing using commodity components. Parallel Comput 26(2–3):243–266CrossRefMATHGoogle Scholar
  13. Candan Caner, Goëffon Adrien, Lardeux Frédéric, Saubion Frédéric (2012) A dynamic island model for adaptive operator selection. Genetic and evolutionary computation conference, QECCO ’12, Philadelphia, PA, USA, July 7–11, 2012, pp 1253–1260Google Scholar
  14. Cantú-Paz Erick (1998) A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis 10:141–171Google Scholar
  15. Cantú-Paz Erick (1999) Topologies, Migration rates, and multi-population parallel genetic algorithms. In: Proceedings of the genetic and evolutionary computation conference (GECCO 1999), 13–17 July 1999, Orlando, Florida, pp 91–98Google Scholar
  16. Cantú-Paz Erick (2000) Efficient and accurate parallel genetic algorithms. Kluwer Academic Publishers, DordrechtMATHGoogle Scholar
  17. Cantú-Paz Erick, Meja-Olvera M (1994) Experimental results in distributed genetic algorithms. In: International symposium on applied corporate computing, pp 99–108Google Scholar
  18. Cohoon JP, Hegde SU, Martin WN, Richards D (1987) Punctuated equilibria: a parallel genetic algorithm. In: Proceedings of the second international conference on genetic algorithms on genetic algorithms and their application, pp 148–154Google Scholar
  19. Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812MathSciNetCrossRefGoogle Scholar
  20. Derrac J, Garcia S, Molina D, Herrera F (2011) A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evolut Comput 1(1):3–18CrossRefGoogle Scholar
  21. Dorronsoro B, Arias D, Luna F, Nebro AJ, Alba E (2007) A grid-based hybrid cellular genetic algorithm for very large scale instances of the CVRP. In: High performance computing & simulation conference (HPCS). IEEE Press, Piscataway, NJ, pp 759–765Google Scholar
  22. Durillo JJ, Nebro AJ, Luna F, Alba E (2008) A study of master-slave approaches to parallelize NSGA-II. In: IEEE international symposium on parallel and distributed processing, 2008. IPDPS 2008, pp 1–8Google Scholar
  23. Foster Ian, Kesselman Carl, Tuecke Steven (2001) The anatomy of the grid: enabling scalable virtual organizations. Int J High Perform Comput Appl 15(3):200–222CrossRefGoogle Scholar
  24. Gordon VS, Whitley LD (1993) Serial and parallel genetic algorithms as function optimizers. In: Proceedings of the 5th international conference on genetic algorithms, pp 177–183Google Scholar
  25. Grefenstette JJ, Gopal R, Rosmaita BJ, Van Gucht D (1985) Genetic algorithms for the traveling salesman problem. In: Proceedings of the 1st international conference on genetic algorithms, pp 160–168Google Scholar
  26. Guan W, Szeto KY (2013) Topological effects on the performance of island model of parallel genetic algorithm. In: Rojas I, Joya G, and Cabestany J (eds) Advances in computational intelligence, vol 7903, pp 11–19Google Scholar
  27. He H, Sýkora O, Salagean A (2006) Various Island-based parallel genetic algorithms for the 2-page drawing problem. In: Proceedings of the IASTED international conference on parallel and distributed computing and networks, as part of the 24th IASTED international multi-conference on applied informatics, 14–16 Feb 2006, Innsbruck, Austria, pp 316–323Google Scholar
  28. Jakobović Domagoj, Golub Marin, Ćupić Marko (2014) Asynchronous and implicitly parallel evolutionary computation models. Soft Comput 18(6):1225–1236CrossRefGoogle Scholar
  29. Johar FM, Azmin FA, Suaidi MK, Shibghatullah AS, Ahmad BH, Salleh SN, Aziz MZAA, Md Shukor M (2013) A review of genetic algorithms and parallel genetic algorithms on graphics processing unit (GPU). In: 2013 IEEE International conference on control system, computing and engineering (ICCSCE), pp 264–269Google Scholar
  30. Knysh DS, Kureichik VM (2010) Parallel genetic algorithms: a survey and problem state of the art. J Comput Syst Sci Int 49(4):579–589MathSciNetCrossRefGoogle Scholar
  31. Lässig Jörg, Sudholt Dirk (2013) Design and analysis of migration in parallel evolutionary algorithms. Soft Comput 17(7):1121–1144CrossRefMATHGoogle Scholar
  32. Lim Dudy, Ong Yew-Soon, Jin Yaochu, Sendhoff Bernhard, Lee Bu-Sung (2007) Efficient hierarchical parallel genetic algorithms using grid computing. Future Gen Comput Syst 23(4):658–670CrossRefGoogle Scholar
  33. Limmer S, Fey D (2010) Framework for distributed evolutionary algorithms in computational grids. In: Cai Z, Hu C, Kang Z, Liu Y (eds) Advances in computation and intelligence, vol 6382. Springer, Berlin, pp 170–180Google Scholar
  34. Lopes RA, Silva RCP, Campelo F, Guimarães FG (2013) Dynamic selection of migration flows in Island model differential evolution. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation, pp 173–174Google Scholar
  35. Lopes RA, Pedrosa SRC, Freitas ARR, Campelo F, Guimarães FG (2014) A study on the configuration of migratory flows in island model differential evolution. In: Proceedings of the 2014 conference companion on genetic and evolutionary computation companion, pp 1015–1022Google Scholar
  36. Luna Francisco, Nebro Antonio J, Alba Enrique, Durillo Juan J (2008) Solving largescale real-world telecommunication problems using a grid-based genetic algorithm. Eng Optim 40(11):1067–1084CrossRefGoogle Scholar
  37. Luque G, Alba E (2011) Parallel genetic algorithms: theory and real world applications.Studies in Computational Intelligence, vol 367. Springer, BerlinMATHGoogle Scholar
  38. Luque G, Alba E, Dorronsoro B (2009) An asynchronous parallel implementation of a cellular genetic algorithm for combinatorial optimization. In: Proceedings of the 11th annual conference on genetic and evolutionary computation, pp 1395–1402Google Scholar
  39. Melab N, Cahon S, Talbi E-G (2006) Grid computing for parallel bioinspired algorithms. J Parallel Distrib Compu 66(8):1052–1061 (Special Issue: Parallel Bioinspired Algorithms Special Issue: Parallel Bioinspired Algorithms) CrossRefMATHGoogle Scholar
  40. Myers Daniel S, Cummings Michael P (2003) Necessity is the mother of invention: a simple grid computing system using commodity tools. J Parallel Distrib Comput 63(5):578–589 (Special Issue on Computational Grids) CrossRefGoogle Scholar
  41. Nebro AJ, Luque G, Luna F, Alba E (2008) DNA fragment assembly using a grid-based genetic algorithm. Comput Oper Res 35(9):2776–2790 (Part Special Issue: Bio-inspired Methods in Combinatorial Optimization) CrossRefMATHGoogle Scholar
  42. Nowostawski M, Poli R (1999) Parallel genetic algorithm taxonomy. In: Third international conference on knowledge-based intelligent information engineering systems, 1999, pp 88– 92Google Scholar
  43. Pettey CC, Leuze MR (1989) A theoretical investigation of a parallel genetic algorithm. In: Proceedings of the 3rd international conference on genetic algorithms, pp 398–405Google Scholar
  44. Plaza Antonio, Valencia David, Plaza Javier, Martinez Pablo (2006) Commodity clusterbased parallel processing of hyperspectral imagery. J Parallel Distrib Comput 66(3):345–358CrossRefMATHGoogle Scholar
  45. Potvin Jean-Yves (1996) Genetic algorithms for the traveling salesman problem. Ann Oper Res 63(3):337–370CrossRefMATHGoogle Scholar
  46. Reinelt Gerhard (1991) TSPLIB—a traveling salesman problem library. ORSA J Comput 3(4):376–384CrossRefMATHGoogle Scholar
  47. Reinelt G (2008) TSPLIB. http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/. Accessed 15 June 2015
  48. Ruciński M, Izzo D, Biscani F (2010) On the impact of the migration topology on the Island model. Parallel Computing 36(10–11). Parallel Architectures and Bioinspired Algorithms, pp 555 –571Google Scholar
  49. Rzeźniczak T (2012) Implementation aspects of data visualization based on map of attributes. J Theor Appl Comput Sci 6(4):24–36Google Scholar
  50. Saiko D (2005) Traveling salesman problem (Java Genetic Algorithm Solution). http://traveling-salesman-problem-java-genetic.software.informer.com. Accessed 10 Dec 2014
  51. Sekaj I (2004) Robust parallel genetic algorithms with re-initialisation. In: Yao X, Burke EK, Lozano JA, Smith J, Merelo-Guervós JJ, Bullinaria JA, Rowe JE, Tiňo P, Kabán A, Schwefel H-P (eds) Parallel problem solving from nature–PPSN VIII. Lecture notes in computer science, vol 3242. Springer, Berlin, pp 411–419Google Scholar
  52. Sena Giuseppe A, Megherbi Dalila, Isern Germinal (2001) Implementation of a parallel genetic algorithm on a cluster of workstations: traveling salesman problem, a case study. Future Gener Comput Syst 17(4):477–488Google Scholar
  53. Skolicki Z, De Jong K (2007) The importance of a two-level perspective for island model design. In: IEEE congress on evolutionary computation, 2007. CEC 2007, pp 4623–4630Google Scholar
  54. Talbi EG, Cahon S, Melab N (2007) Designing cellular networks using a parallel hybrid metaheuristic on the computational grid. Comput Commun 30(4):698–713CrossRefGoogle Scholar
  55. Tang J, Lim MH, Ong YS, Er MJ (2004) Study of migration topology in island model parallel hybrid-GA for large scale quadratic assignment problems. In: ICARCV 2004 8th control, automation, robotics and vision conference, 2004, vol 3, 2286–2291Google Scholar
  56. Tantar AA, Melab N, Talbi EG, Parent B, Horvath D (2007) A parallel hybrid genetic algorithm for protein structure prediction on the computational grid. Future Gener Comput Syst 23(3):398–409CrossRefGoogle Scholar
  57. Umbarkar AJ, Joshi MS (2013) Review of parallel genetic algorithm based on computing paradigm and diversity in search space. ICTACT J Soft Comput 3:615–622CrossRefGoogle Scholar
  58. Wang G, Wu D, Szeto KY (2011) Quasi-parallel genetic algorithms with different communication topologies. In: 2011 IEEE congress on evolutionary computation (CEC), pp 721–727Google Scholar
  59. Wang L, Maciejewski AA, Siegel HJ, Roychowdhury VP, Eldridge BD (2005) A study of five parallel approaches to a genetic algorithm for the traveling salesman problem. Intell Autom Soft Comput 11(4):217–234CrossRefGoogle Scholar
  60. Wang L, Maciejewski AA, Siegel HJ, Roychowdhury VP (1998) A comparative study of five parallel genetic algorithms using the traveling salesman problem. In: Proceedings of the first merged international ... and symposium on parallel and distributed processing 1998, parallel processing symposium, 1998. IPPS/SPDP 1998, pp 345–349Google Scholar
  61. Weise T, Chiong R, Lassig J, Tang Ke, Tsutsui S, Chen Wenxiang, Michalewicz Z, Yao Xin (2014) Benchmarking optimization algorithms: an open source framework for the traveling salesman problem. IEEE Comput Intell Mag 9(3):40–52CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • José Valente de Oliveira
    • 1
  • Sérgio Baltazar
    • 2
  • Helder Daniel
    • 2
  1. 1.CEOTUniversidade do AlgarveFaroPortugal
  2. 2.CIEOUniversidade do AlgarveFaroPortugal

Personalised recommendations