Memetic algorithms for parallel code optimization

International Journal of Parallel Programming

Volumn 35, Issue 1, 2007, Pages 33-61

  Özcan, Ender ^a   Onbaşioğlu, Esin ^a  

^a YEDITEPE UNIVERSITY   (Turkey)

Author keywords

Distributed memory parallel computers; Memetic algorithms; Parallelizing compilers; Search methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DISTRIBUTED DATABASE SYSTEMS; OPTIMIZATION; PROGRAM PROCESSORS; SEARCH ENGINES;

DISTRIBUTED MEMORY PARALLEL COMPUTERS; MEMETIC ALGORITHMS; PARALLELIZING COMPILERS; SEARCH METHODS;

PARALLEL PROCESSING SYSTEMS;

EID: 33847409760     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10766-006-0026-x     Document Type: Article

References (43)

1. J. Anderson and M. Lam, Global Optimizations for Parallelism and Locality on Scalable Parallel Machines, in Proc. of the ACM SIGPLAN Conf. on Programming Language Design and Implementation, 112-125 (1993).
2. P. Banerjee, J. Chandy, M. Gupta, E. Hodge, J. Holm, A. Lain, D. Palermo, S. Ramaswamy, and E. Su, The Paradigm Compiler for Distributed-Memory Multicomputers, IEEE Comput. October: 37-47 (1995).
3. O. Beaumont, V. Boudet, A. Petitet, F. Rastello, and Y. Robert, A Proposal for Heterogeneous Cluster Scalapack, IEEE Trans. Comput. 50(10):1052-1071 (2001).
4. O. Beaumont, V. Boudet, F. Rastello, and Y. Robert, Matrix Multiplication on Heterogeneous Platforms, IEEE Trans. Parall. Distri. Syst. 12(10):1033-1051 (2001).
5. R. Bixby, K. Kennedy, and U. Kremer, Automatic Data Layout using 0-1 Integer Programming, in Proc. Int. Conf. on Parallel Architectures and Compilation Techniques (PACT'94) pp. 111-122 (1994).
6. H. Bremermann, Optimization Through Evolution and Recombination, Self-Organizing Syst. 93-106 (1962).
7. T. Chen, and J. Sheu. Communication-Free Data Allocation Techniques for Parallelizing Compilers on Multicomputers, IEEE Trans. Parall. Distri. Syst. 5:924-938 (1994).
8. J. Choi, J. Dongarra, and D. W Walker, The design of a parallel, Dense Linear Algebra Software Library: Reduction to Hessenberg, Tridiagonal and Bidiagonal Form, in Proc. of the 2nd Workshop on Environments and Tools for Parallel Scientific Computing, pp. 98-111 (1994).
9. H.G. Cobb, An investigation into the use of hypermutation as an adaptive operator in Genetic Algorithms Having Continuous, Time-dependent Nonstationary Environment, NRL Memorandum Report 6760 (1990).
10. K.A. De Jong, An Analysis of the Behavior of a Class of Genetic Adaptive Systems, PhD Thesis, University of Michigan (1975).
11. A. Fraser, Simulation of Genetic Systems by Automatic Digital Computers, 2 Vols, Aust. J Biol. Sci. 10:484-491 (1957).
12. G.J. Friedman, Digital Simulation of An Evolutionary Process, Gen. Sysr. Yearbook, 4:171-184 (1959).
13. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, Reading, MA (1989).
14. J. H. Holland, Adaptation in Natural and Artificial Systems. University of Michican Press, (1975).
15. C. H. Huang and P. Sadayappan, Communication-Free Hyperplane Partitioning of Nested Loops, J. Parall. and Distr. Comput. 19:90-102 (1993).
16. K. Ikudome, G. Fox, A. Kolawa, and J. Flower, An Automatic and Symbolic Parallelization System for Distributed Memory Parallel Computers, in Proc. of 5th Distributed Memory Computing Conference, pp.1105-1114 (1990).
17. A. H. Karp, Programming for Parallelism, IEEE Comput. 20(5):43-57 (1987).
18. K. Knobe, J. Lucas, and G. Steele, Data Optimizations: Allocation of Arrays to Reduce Communication on SIMD machines, J. Parall. Distr. Compu. 8(2):102-118 (1990).
19. N. Krasnogor, Studies on the Theory and Design Space of Memetic Algorithms, PhD Thesis, University of the West of England (2002).
20. N. Krasnogor and J. Smith, Emergence of Profitable Search Strategies Based on a Simple Inheritance Mechanism, in Proc. of the 2001 International Genetic and Evolutionary Computation Conference (GECCO200I) (2001).
21. N. Krasnogor and S. Gustafson, A Study on the use of "Self- Generation" in Memetic Algorithms, Nat. Comput. 3(1):53-76 (2004).
22. P. Lee, Efficient algorithms for Data Distribution on Distributed Memory Parallel Computers, IEEE Trans. Parall. Distr. Syst. 8(8):825-839 (1997).
23. J. Li, and M. Chen, Index Domain Alignment: Minimizing Costs of Cross-referencing between Distributed Arrays, in Proc. of the Third Symp. on the Frontiers of Massively Parallel Computation, pp. 424-433 (1990).
24. M. Mace, Memory Storage Patterns in Parallel Processing. Kluwer Academic, Dordrecht (1987).
25. M. Mitchell and S. Forrest, Genetic Algorithms and Artificial Life, Artificial Life 1(3):267-289 (1994).
26. J. Mohan, Performance of Parallel Programs, PhD dissertation, Dept. of Computer Science, Carnegie-Mellon University, (1984).
27. P. Moscato and M. G. Norman, A Memetic Approach for the Traveling Salesman Problem Implementation of a Computational Ecology for Combinatorial Optimization on Message-Passing Systems, Parall. Comput. Transputer Appl. 177-186 (1992).
28. E. Onbasioglu and L. Ozdamar, Optimization of Data Distribution and Processor Allocation Problem using Simulated Annealing, J. Supercomp. 25:237-253 (2003).
29. E. Onbasioglu and Y. Paker, A Comparative Workload-based Methodology for Performance Evaluation of Parallel Computers, Future Gen. Comput. Syst. 12:512-545 (1997).
30. E. Ozean An Empirical Investigation on Memes, Self-generation and Nurse Rostering, in Proc. of the 6th International Conference on the Practice and Theory of Automated Timetabling, 246-263 (2006).
31. E. Ozean, Memetic Algorithms for Nurse Rostering, in P. Yolum, T. Güngör, F. Gürgen, and C. Özturan, (Eds.) Proc. of the 20th International Symposium on Computer and Information Sciences, Lecture Notes in Computer Science, Springer-Verlag. pp.482-492 (2005).
32. E. Ozean and C. K. Mohan, Steady State Memetic Algorithm for Partial Shape Matching, V. William Porto, N. Saravanan, Donald E. Waagen, and A. E. Eiben (Eds.) in Evolutionary Programming VII. 7th International Conference, EP98, Lecture Notes in Computer Science. Springer, vol. 1447:527-536. 1998.
33. E. Ozean and E. Onbasioglu, Genetic Algorithms for Parallel Code Optimization, in Proc. of 2004 IEEE Congress on Evolutionary Computation, 2:pp.1775-1781 (2004).
34. D. Palermo, Compiler Techniques for Optimizing Communication and Data Distribution for Distributed Memory Multicomputers, PhD thesis, University of Illinois at Urbana-Champaign (1996).
35. A. Prügel-Bennett and Shapiro, J. L., An Analysis of Genetic Algorithms Using Statistical Mechanics. Physica D 104:75-114 (1997).
36. N. J. Radcliffe and P. D. Surry, Formal Memetic Algorithms, Evol. Comput. AISB Workshop. 1-16 (1994).
37. J. Ramanujan and P. Sadayappan, Compile-time Techniques for Data Distribution in Distributed Memory Machines, IEEE Trans. Parall. Distr. Syst. 2(4):472-482 (1991).
38. T. Rauber and G. Runger, Deriving Array Distributions by Optimization Techniques, J. Supercomput. 15:271-293 (2000).
39. R. Sierra, Margarita, M. and C. A. Coello Coello, On the Study of Some Theoretical Aspects of Genetic Algorithms, Technical Report EVOCINV-02-2003, Evolutionary Computation Group at CINVESTAV, Sección de Computación, Departamento de Ingeniería Eléctrica, CINVESTAV-IPN, México (2003).
40. J. E. Smith and T. C. Fogarty, Operator and Parameter Adaptation in Genetic Algorithms, Soft Comput. 12:81-87 (1997).
41. L. D. Whitley and M. D. Vose, Foundations of Genetic Algorithms 3, Morgan Kaufmann Los Altos, (1995).
42. S. Wholey, Automatic Data Mapping for Distributed Memory Parallel Computers, Proc. Int. Conf. Supercomput. pp. 25-34 (1992).
43. M.E. Wolf and M. S. Lam, A Data Locality Optimizing Algorithm, in. Proc. ACM SIGPLAN Conf. on Programming Language Design and Implementation, pp. 30-44 (1991).