Abstract
Genetic algorithms (GAs) are one of the evolutionary algorithms for solving continuous nonlinear large-scale optimization problems. In an optimization problem, when dimension size increases, the size of search space increases exponentially. It is quite difficult to explore and exploit such huge search space. GA is highly parallelizable optimization algorithm; still there is a challenge to use all the cores of multicore (viz. Dual core, Quad core, and Octa cores) systems. The paper analyzes the parallel implementation of SGA (Simple GA) called as OpenMP GA. OpenMP (Open Multi-Processing) GA attempts to explore and exploit the search space on the multiple cores' system. The performance of OpenMP GA is compared with SGA with respect to time required and cores utilized for obtaining optimal solution. The results show that the performance of the OpenMP GA is remarkably superior to that of the SGA in terms of execution time and CPU utilization. In case of OpenMP GA, CPU utilization is almost double for continuous nonlinear large-scale test problems for the given system configuration.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Konfrst, Z.: Parallel genetic algorithm: advances, computing trends, application and perspective. In: Proceeding of 18th International Parallel and Distributed Processing Symposium [IPDPS’04], IEEE Computer Society (2004)
Umbarkar, A.J., Joshi, M.S.: Dual Population Genetic Algorithm (GA) versus OpenMP GA for Multimodal Function Optimization. Int. J. Comput. Appl. 64(19), 29–36 (2013)
Arora, R., Tulshyan, R., Deb, K.: Parallelization of binary and real-coded genetic algorithm on GPU using CUDA. In: Congress on Evolutionary Computation, pp. 1–8 (2010)
Vidal, P., Alba, E.: A multi-GPU implementation of a cellular genetic algorithm. In: 2010 IEEE Congress on Evolutionary Computation (2010)
August, A.D., Chiou, K.P.D., Sendag, R., Yi, J.J.: Programming multicores: do application programmers need to write explicitly parallel programs?. In: Computer Architecture Debates in IEEE MICRO, pp. 19–32 (2010)
Cantú-Paz, E.: Efficient and Accurate Parallel Genetic Algorithms. Kluwer Academic Publishers (2000)
Andrei, N.: An unconstrained optimization test functions collection. Adv. Model. Optim. 10(1), 147–161 (2008)
Gagné, C., Parizeau, M., Dubreuil, M.: The master-slave architecture for evolutionary computations revisited. In: Proceedings of the Genetic and Evolutionary Computation Conference, Chicago, IL, 2, pp. 1578–1579 (2003)
Hauser, R., Männer, R.: Implementation of standard genetic algorithms on MIMD machines. In: Parallel Problem Solving from Nature [PPSN3], pp. 504–513 (1994)
Tanese, R.: Parallel genetic algorithm for a hypercube. In: Proceedings of the Second International Conference on Genetic Algorithms [ICGA2], pp. 177–183 (1987)
Tanese, R.: (1989) Distributed genetic algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms [ICGA3], pp. 434–439 (1987)
Voigt, H.M., Born, J., Santibanez-Koref, I.: Modeling and simulation of distributed evolutionary search processes for function optimization. In: Parallel Problem Solving from Nature [PPSN1], pp. 373–380 (1991)
Voigt, H.M., Santibanez-Koref, I., Born, J., Hierarchically structured distributed genetic algorithm. In: Parallel Problem Solving from Nature [PPSN2], pp. 145–154 (1992)
Imade, H., Morishita, R., Ono, I., Ono, N., Okamoto, M.: A grid-oriented genetic algorithm for estimating genetic networks by s-systems. In: SICE 2003 Annual Conference, 3(4–6), pp. 2750–2755 (2003)
Herrera, J., Huedo, E., Montero, R., Llorente, I.: A grid oriented genetic algorithm. Adv. Grid Comput. EGC 2005, 315–322 (2005)
Imade, H., Morishita, R., Ono, I., Ono, N., Okamoto, M.: A grid-oriented genetic algorithm framework for bioinformatics. New Gen. Comput. 22(2), 177–186 (2004)
Wong, M., Wong, T.: Parallel hybrid genetic algorithms on consumer-level graphics hardware. In: Congress on Evolutionary Computation, Canada, pp. 2972–2980 (2006)
Oiso, M., Matumura, Y.: Accelerating steady-state genetic algorithms based on CUDA architecture. In: 2011 IEEE Congress on Evolutionary Computation, pp. 687–692 (2011)
Zheng, L., Lu, Y., Ding, M., Shen, Y., Guo, M., Guo, S.: Architecture-based performance evaluation of genetic algorithms on multi/many-core systems. In: proceeding of 14th IEEE International Conference on Computational Science and Engineering, CSE 2011, Dalian, China, (2011)
Cantú-Paz, E.: A Report: A Survey of Parallel Genetic Algorithms. Department of Computer Science and Illinois Genetic Algorithms Laboratory University of Illinois at Urbana-Champaign (2002)
Molga, M., Smutnicki, C.: Test functions for optimization needs—2005. Unpublished (2005)
Mohan, C., Deep, K.: Optimization Techniques, first edition, New Age International Publication (2009)
Susan, L., Graham, P.B., Kessler, M.K., McKusick (2000) gprof: a Call Graph Execution Profiler1, Electrical Engineering and Computer Science Department University of California, Berkeley, California
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media Singapore
About this paper
Cite this paper
Umbarkar, A.J. (2016). OpenMP Genetic Algorithm for Continuous Nonlinear Large-Scale Optimization Problems. In: Pant, M., Deep, K., Bansal, J., Nagar, A., Das, K. (eds) Proceedings of Fifth International Conference on Soft Computing for Problem Solving. Advances in Intelligent Systems and Computing, vol 437. Springer, Singapore. https://doi.org/10.1007/978-981-10-0451-3_20
Download citation
DOI: https://doi.org/10.1007/978-981-10-0451-3_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-0450-6
Online ISBN: 978-981-10-0451-3
eBook Packages: EngineeringEngineering (R0)