Heterogeneous computing and parallel genetic algorithms

Journal of Parallel and Distributed Computing

Volumn 62, Issue 9, 2002, Pages 1362-1385

  Alba, Enrique ^a   Nebro, Antonio J ^a   Troya, José M ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Heterogeneous computational; Java; Parallel genetic algorithms; Speedup; Systems

Indexed keywords

EID: 0036749304     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2002.1851     Document Type: Article

References (31)

1. S. G. Akl, "The Design and Analysis of Parallel Algorithms," Prentice-Hall, Englewood Cliffs, NJ, 1991.
2. E. Alba and J. M. Troya, A survey of parallel distributed genetic algorithms, Complexity 4 (1999), 31-52.
3. E. Alba and J. M. Troya, Analyzing synchronous and asynchronous parallel distributed genetic algorithms, Future Generation Comput. Systems 17 (2001), 451-465.
4. D. Andre and J. R. Koza, A parallel implementation of genetic programming that achieves superlinear performance, J. Inform. Sci. 106 (1998), 201-218.
5. T. Bäck, "Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms," Oxford Univ. Press, New York, 1996.
6. T. C. Belding, The distributed genetic algorithm revisited, in "Proceedings of the Sixth International Conference on Genetic Algorithms" (L. J. Eshelman, Ed.), pp. 114-121, Morgan Kaufmann, Los Altos, CA, 1995.
7. P. Calégari, F. Guidec, P. Kuonen, and D. Kobler, Parallel island-based genetic algorithm for radio network design. J. Parallel Distrib. Comput. 47 (1997), 86-90.
8. E. Cantú-Paz and D. E. Goldberg, Predicting speedups of idealized bounding cases of parallel genetic algorithms, in "Proceedings of the Seventh International Conference on Genetic Algorithms" (T. Bäck, Ed.), pp. 113-120, Morgan Kaufmann, Los Altos, CA, 1997.
9. V. Donaldson, F. Berman, and R. Paturi, Program speedup in a heterogeneous computing network, J. Parallel Distrib. Comput. 21 (1994), 316-322.
10. I. Foster and C. Kesselmann, Globus: A metacomputing infrastructure toolkit, J. Supercomput. Appl. 11 (1997), 115-128.
11. R. Gillet, Memory channel network for PCI, IEEE Micro. 16 (1996), 12-18.
12. D. E. Goldberg, "Genetic Algorithms in Search, Optimization and Machine Learning," Addison-Wesley, Reading, MA, 1989.
13. V. S. Gordon and D. Whitley, Serial and parallel genetic algorithms as function optimizers, in "Proceedings of the Fifth International Conference on Genetic Algorithms" (S. Forrest, Ed.), pp. 177-183, Morgan Kaufmann, Los Altos, CA, 1993.
14. UEA CALMA Group, "Calma Project Report 2.4: Parallelism in Combinatorial Optimisation" Technical Report, School of Information Systems, University of East Anglia, Norwich, U.K., September 18, 1995.
15. J. L. Gustafson, G. R. Montry, and R. E. Brenner, Development of parallel methods for a 1024-processor hypercube, SIAM Sci. Statist. Comput. 9 (1988), 609-638.
16. W. E. Hart, S. Baden, R. K. Belew, and S. Kohn, Analysis of the numerical effects of parallelism on a parallel genetic algorithm, in "IEEE Proceedings of the Workshop on Solving Combinatorial Optimization Problems in Parallel" (IEEE, Ed.), pp. CD-ROM IPPS97, IEEE Press, New York, 1997.
17. J. H. Holland, "Adaptation in Natural and Artificial Systems," The MIT Press, Cambridge, MA, 2nd ed., 1992.
18. K. A. De Jong, M. A. Potter, and W. M. Spears, Using problem generators to explore the effects of epistasis, in "Proceedings of the 7th International Conference of Genetic Algorithms" (T. Bäck, Ed.), pp. 338-345, Morgan Kaufman, Los Altos, CA, 1997.
19. A. H. Karp and H. P. Flatt, Measuring parallel processor performance, Comm. ACM 33 (1990), 539-543.
20. T. Lai and S. Sahni, Anomalies in parallel branch-and-bound algorithms, Comm. ACM 27 (1984), 594-602.
21. S. C. Lin, W. F. Punch, and E. D. Goodman, Coarse-grain parallel genetic algorithms: Categorization and a new approach, in Sixth IEEE SPDP, pp. 28-37, 1994.
22. Z. Michalewicz, "Genetic Algorithms + Data Structures = Evolution Programs," 3rd ed., Springer-Verlag, Heidelberg, 1996.
23. H. Mühlenbein, M. Schomish, and J. Born, The parallel genetic algorithm as a function optimizer, Parallel Comput. 17 (1991), 619-632.
24. M. Munetomo, Y. Takai, and Y. Sato, An efficient migration scheme for subpopulation-based ansynchronously parallel genetic algorithms, in "Proceedings of the Fifth International Conference on Genetic Algorithms" (S. Forrest, Ed.), pp. 649, Morgan Kaufmann Publishers, San Mateo, CA, 1993.
25. J. Schaffer, L. J. Eshelman, and D. Offutt, Spurious correlations and premature convergence in genetic algorithms, in "Foundations of Genetic Algorithms" (G. J. E. Rawlings, Ed.), pp. 102-122, Morgan Kaufman, Los Altos, CA, 1991.
26. R. Shonkwiler, Parallel genetic algorithms, in "Proceedings of the Fifth International Conference on Genetic Algorithms" (S. Forrest, Ed.), pp. 199-205, Morgan Kaufmann, Los Altos, CA, 1993.
27. P. Spiessens and B. Manderick, A massively parallel genetic algorithm, in "Proceedings of the Fourth International Conference on Genetic Algorithms" (L. B. Booker and R. K. Belew, Eds.), pp. 279-286, Morgan Kaufmann, Los Altos, CA, 1991.
28. J. Sprave, A unified model of non-panmictic population structures in evolutionary algorithms, in "Congress on Evolutionary Computation (CEC'99)," pp. 1384-1391, IEEE Press, Piscataway, NJ, 1999.
29. G. Syswerda, A study of reproduction in generational and steady-state genetic algorithms, in "Foundations of Genetic Algorithms" (G. J. E. Rawlins, Ed.), pp. 94-101, Morgan Kaufmann, Los Altos, CA, 1991.
30. R. Tanese, Distributed genetic algorithms in "Proceedings of the Third International Conference on Genetic Algorithms" (J. D. Schaffer, Ed.), pp. 434-439, Morgan Kaufmann, Los Altos, CA, 1989.
31. D. Whitley and T. Starkweather, GENITOR II: A distributed genetic algorithm, J. Exp. Theoret. Artif. Intell. 2 (1990), 189-214.