Abstract
In this work we address the Genetic Algorithm parallelization problem, over a LAN-based message passing computer architectures, using PVM 3.1 (Parallel Virtual Machine — Public Domain software) as a software integration tool. The strategy used has been to split the problem into independent functions, most of them running in server processors which perform the work, and report periodically their partial results to a master node which redistributes the information in order to improve the work in each server. The strategy we present here handles all data communications through sockets via PVM calls, in such a way that the communication latency and the overall data-passing load are significantly reduced. In addition, a dynamic load balancing and fault tolerant capabilities are achieved. As an application, we study the Routing problem, which is a classical optimization problem with combinatorial complexity.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Baker, J.E. “Reducing Bias and Inefficiency in the Selection Algorithm”, in J.J. Grefenstette, ed., Proceedings of the Second Int. Conf. on Genetic Algorithms and their Appl., Lawrence Erlbaum Associates, pp. 14–22, 1987.
Collins, R.J., Jefferson, D.R., “Selection in Massively Parallel Genetic Algorithms”. In R. Belew and L. Booker, ed., Proceedings of the Fourth Int. Conf. on Genetic Algorithms. Morgan Kaufmann, pp. 249–256, 1991.
Fagerholm J., Saarinen S., “Programing in the metacomputer environment PVM”, CSC News, APr, 5(1), pp. 21–23, 1993.
Geist G.A., Sunderam V.S., “Network Based Concurrent Computing on the PVM System” US Department of Energy
Goldberg,D.E. and Lingle,R. “Alleles, Loci, and the Traveling Salesman Problem”, in J.J. Grefenstette (editor), Proceedings of the First International Conference on Genetics Algorithms and their Applications, 1985.
Helin, J.; “Workstation Clustering at Tampere University of Technology”, CSC News, Vol.5 Nℴ1 pp. 14–17, April 1993.
Kröger, B.,Schwenderling, P., Vornberger, O., “Parallel Genetic Packing on Transputers”, In J.Stender, ed., IOS Press, 1993.
Marin, F.J., Gonzalez, F.J., Sandoval, F. “The Routing Problem in Traffic Control using Genetic Algorithms”. 2nd IFAC Symposium on Intelligent Components and Instruments for Control Applications. 1994.
Maruyama, T., Konagaya, A., Konishi, K., “An Asynchronous Fine-Grained Parallel Genetic Algorithm”. In R: Männer and B. Manderick, editors, Parallel Problem Solving from Nature, 2, Elsevier Science Publishers B.V., pp. 563–572, 1992.
Miller, P.L., Nadkarni, P.M. and Bercovitz, P.A., “Harnessing networked workstations as a powerful parallel computer”, CABIOS, 8(2), 1992.
Sunderam, V.S., “PVM: A framework for parallel distributed computing”, Concurrency, Practice and Experience, 2(4), pp. 315–339, 1990.
Sunderam V., Manchek R., Dongarra J., Geist A. Beguelin A. Jiang W., “PVM 3.0 User's Guide and Reference manual”. Oak Ridge Nat. Lab. 1993.
Trelles-Salazar O., Zapata E., Carazo J.M., “Mapping Strategies for Sequential Sequence Comparison Algorithms onto LAN-message passing Architectures”, High Performance Computing and Networking, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marin, F.J., Trelles-Salazar, O., Sandoval, F. (1994). Genetic Algorithms on LAN-message passing architectures using PVM: Application to the Routing problem. 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_296
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_296
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