Abstract
Bio-inspired optimization algorithms have natural parallelism but practical implementations in parallel and distributed computational systems are nontrivial. Gains from different parallelism philosophies and implementation strategies may vary widely. In this paper, we contribute with a new taxonomy for various parallel and distributed implementation models of metaheuristic optimization. This taxonomy is based on three factors that every parallel and distributed metaheuristic implementation needs to consider: control, data, and memory. According to our taxonomy, we categorize different parallel and distributed bio-inspired models as well as local search metaheuristic models. We also introduce a new designed GPU parallel model for the Kohonen’s self-organizing map, as a representative example which belongs to a significant category in our taxonomy.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kohonen, T.: Self-organizing maps, vol. 30. Springer (2001)
Freitas, A.A., Lavington, S.H.: Data parallelism, control parallelism, and related issues. In: Mining Very Large Databases with Parallel Processing, pp. 71–78. Springer (2000)
Crainic, T.G., Toulouse, M.: Parallel meta-heuristics. In: Handbook of Metaheuristics, pp. 497–541. Springer (2010)
Crainic, T.G., Toulouse, M.: Parallel strategies for meta-heuristics. Springer (2003)
Tomassini, M.: Parallel and distributed evolutionary algorithms: A review (1999)
Konfrst, Z.: Parallel genetic algorithms: Advances, computing trends, applications and perspectives. In: Proceedings. 18th International Parallel and Distributed Processing Symposium, p. 162. IEEE (2004)
Cohoon, J.P., Hegde, S.U., Martin, W.N., Richards, D.: Punctuated equilibria: a parallel genetic algorithm. In: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, July 28-31. Massachusetts Institute of Technology, L. Erlhaum Associates, Cambridge, Hillsdale (1987)
Manderick, B., Spiessens, P.: Fine-grained parallel genetic algorithms. In: Proceedings of the Third International Conference on Genetic Algorithms, pp. 428–433. Morgan Kaufmann Publishers Inc. (1989)
Andre, D., Koza, J.R.: Parallel genetic programming: A scalable implementation using the transputer network architecture. In: Advances in Genetic Programming, pp. 317–337. MIT Press (1996)
Folino, G., Pizzuti, C., Spezzano, G.: A scalable cellular implementation of parallel genetic programming. IEEE Transactions on Evolutionary Computation 7, 37–53 (2003)
Dorigo, M.: Optimization, Learning and Natural Algorithms. PhD thesis, Politecnico di Milano (1992)
Pedemonte, M., Nesmachnow, S., Cancela, H.: A survey on parallel ant colony optimization. Applied Soft Computing 11, 5181–5197 (2011)
Pedemonte, M., Cancela, H.: A cellular ant colony optimisation for the generalised steiner problem. International Journal of Innovative Computing and Applications 2, 188–201 (2010)
Randall, M., Lewis, A.: A parallel implementation of ant colony optimization. Journal of Parallel and Distributed Computing 62, 1421–1432 (2002)
Stützle, T.: Parallelization Strategies for Ant Colony Optimization. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 722–731. Springer, Heidelberg (1998)
Bai, H., OuYang, D., Li, X., He, L., Yu, H.: Max-min ant system on gpu with cuda. In: 2009 Fourth International Conference on Innovative Computing, Information and Control (ICICIC), pp. 801–804. IEEE (2009)
McConnell, S., Sturgeon, R., Henry, G., Mayne, A., Hurley, R.: Scalability of self-organizing maps on a gpu cluster using opencl and cuda. Journal of Physics: Conference Series 341, 012018 (2012)
Yoshimi, M., Kuhara, T., Nishimoto, K., Miki, M., Hiroyasu, T.: Visualization of pareto solutions by spherical self-organizing map and its acceleration on a gpu. Journal of Software Engineering and Applications 5 (2012)
Wang, H., Zhang, N., Créput, J.-C.: A Massive Parallel Cellular GPU Implementation of Neural Network to Large Scale Euclidean TSP. In: Castro, F., Gelbukh, A., González, M. (eds.) MICAI 2013, Part II. LNCS, vol. 8266, pp. 118–129. Springer, Heidelberg (2013)
Bentley, J.L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Transactions on Mathematical Software (TOMS) 6, 563–580 (1980)
Créput, J.C., Koukam, A.: A memetic neural network for the euclidean traveling salesman problem. Neurocomputing 72, 1250–1264 (2009)
Talbi, E.G.: Metaheuristics: from design to implementation, vol. 74. John Wiley & Sons (2009)
Van Luong, T., Melab, N., Talbi, E.G.: Gpu computing for parallel local search metaheuristic algorithms. IEEE Transactions on Computers 62, 173–185 (2013)
Nguyen, H.D., Yoshihara, I., Yamamori, K., Yasunaga, M.: Implementation of an effective hybrid ga for large-scale traveling salesman problems. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics 37, 92–99 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, H., Créput, JC. (2014). Parallel and Distributed Implementation Models for Bio-inspired Optimization Algorithms. In: Siarry, P., Idoumghar, L., Lepagnot, J. (eds) Swarm Intelligence Based Optimization. ICSIBO 2014. Lecture Notes in Computer Science(), vol 8472. Springer, Cham. https://doi.org/10.1007/978-3-319-12970-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-12970-9_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12969-3
Online ISBN: 978-3-319-12970-9
eBook Packages: Computer ScienceComputer Science (R0)