Referenced Items are not available for this document.
Genetic algorithms have been used successfully as a global optimization method when the search space is very large. To characterize and analyze the performance of genetic algorithms on a cluster of workstations, a parallel version of the GENESIS 5.0 was developed using PVM 3.3. This version, called VMGENESIS, was used to study a nonlinear least-squares problem. Performance results show that linear speedups can be achieved if the basic distributed genetic algorithm is combined with a simple dynamic load-balancing mechanism. Results also show that the quality of search changes significantly with the number of processors involved in the computation and with the frequency of communication
Published in:
Parallel Processing, 1996. Vol.3. Software., Proceedings of the 1996 International Conference on
(Volume:2
)
Date of Conference: 12-16 Aug 1996
- Page(s):
- 29 - 36 vol.2
- Meeting Date :
- 12 Aug 1996-16 Aug 1996
- ISSN :
- 0190-3918
- Print ISBN:
- 0-8186-7623-X
- INSPEC Accession Number:
- 5376115
- Conference Location :
- Ithaca, NY
- Digital Object Identifier :
- 10.1109/ICPP.1996.537378
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
