Abstract
Genetic Algorithms (GAs) have been implemented on a number of multiprocessor machines. In many cases the GA has been adapted to the hardware structure of the system. This paper describes the implementation of a standard genetic algorithm on several MIMD multiprocessor systems. It discusses the data dependencies of the different parts of the algorithm and the changes necessary to adapt the serial version to the parallel versions. Timing measurements and speedups are given for a common problem implemented on all machines.
This work has been supported by the Deutsche Forschungsgemeinschaft (DFG) under grant Ma 1150/8-1.
Preview
Unable to display preview. Download preview PDF.
References
J.H. Holland, Adaption in Natural and Artificial Systems (The University of Michigan Press, Ann Arbor, 1975)
D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, (Addison-Wesley, Reading, 1988)
M. Gorges-Schleuter, ASPARAGOS: An Asynchronous Parallel Genetic Optimization Strategy, Proc. 3rd Intl. Conf. on Genetic Algorithms (1989) 422–427
T. Fogarty, Implementing the Genetic Algorithm on Transputer Based Parallel Processing Systems, Parallel Problem Solving from Nature 1 (1991) 145–149
J.P. Cohoon, W.N. Martin, D.S. Richards, A Multi-population Genetic Algorithm for Solving the K-Partition Problem on Hyper-cubes, Proc. 4th Intl. Conf on Genetic Algorithms (1991) 244–248
R.J. Collins, D.R. Jefferson, Selection in Massively Parallel Genetic Algorithms, Proc. 4th Intl. Conf. on Genetic Algorithms (1991) 249–256
P. Spiessens, B. Manderick, A Massively Parallel Genetic Algorithm, Proc. 4th Intl. Conf. on Genetic Algorithms (1991) 279–285
C.C. Pettey, M.R. Leuze, A Theoretical Investigation of a Parallel Genetic Algorithm, Proc. 3rd Intl. Conf. on Genetic Algorithms (1989) 398–405
R. Tanese, Distributed Genetic Algorithms, Proc. 3rd Intl. Conf. on Genetic Algorithms (1989) 434–439
M.G.A. Verhoeven, E.H.L. Aarts, E. v. de Sluis, Parallel Local Search and the Travelling Salesman Problem, Parallel Problem Solving from Nature 2 (1992) 543–552
T. Maruyma, A. Konagaya, I. Konishi: An Asynchronous Fine-Grained Parallel Genetic Algorithm, Parallel Problem Solving from Nature 2 (1992) 563–572
H. Tamaki, Y. Nishikawa: A Parallel Genetic Algorithm based on a Neighborhood Model and Its Application to the Jobshop Scheduling, Parallel Problem Solving from Nature 2 (1992) 573–582
H. Mühlenbein, Parallel Genetic Algorithms, Population Genetics and Combinatorial Optimization; J.D. Becker, I. Eisele, F.W. Mündemann (Eds.): Parallelism, Learning, Evolution, Lect. Notes in Comp. Sci. 565, (Springer,Berlin, 1991) 398–406
R. Hauser, H. Horner, R. Männer, M. Makhaniok, Architectural Considerations for NERV—a General Purpose Neural Network Simulation System; in J. D. Becker, I. Eisele, F. W. Mündemann (Eds.): Parallelism, Learning, Evolution, Lect. Notes in Comp. Sci. 565, (Springer, Berlin, 1991) 183–195
The VMEbus Specification, Rev. C, VMEbus Int'l Trade Association (1987)
R.M. Stallman, Using and Porting GNU CC, Free Software Foundation (1992)
R. Schuhmacher (Ed.), One Year KSR1 at the Univerity of Mannheim: Results and Experience, RUM 35/93, University of Mannheim (1993)
H. Kredel, Cornputeralgebra on a KSR1 Parallel Computer, in [17], 26–34
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hauser, R., Männer, R. (1994). Implementation of standard genetic algorithm on MIMD machines. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_293
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_293
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58484-1
Online ISBN: 978-3-540-49001-2
eBook Packages: Springer Book Archive