A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3004, Issue , 2004, Pages 62-71

  Demiroz, Betul ^a   Topcuoglu, Haluk ^a   Kandemir, Mahmut ^b  

^a MARMARA UNIVERSITY   (Turkey)

^b The Pennsylvania State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; OPTIMIZATION;

COMPUTATIONAL EXPERIMENT; DOMAIN-SPECIFIC INFORMATION; HYBRID EVOLUTIONARY ALGORITHM; LOCAL SEARCH TECHNIQUES; REGISTER ALLOCATION; RUN-TIME PERFORMANCE; STATE-OF-THE-ART ALGORITHMS; SYNTHETIC BENCHMARK;

EVOLUTIONARY ALGORITHMS;

EID: 33646770607     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24652-7_7     Document Type: Article

References (11)

1. P. Briggs, K. Cooper, K. Kennedy, L. Torczon, Coloring Heuristics for Register Allocation, Proc. of SIGPLAN 89 Conference on Programming Language Design and Implementation, pp. 275-284, Portland, Oregon, 1989.
2. P. Briggs, K. Cooper, L. Torczon, Improvements to Graph Coloring Register Allocation, ACM Transactions on Programming Languages and Systems, vol. 16, no. 3, pp. 428-455, 1994.
3. G. J. Chaitin, Register Allocation and Spilling via Graph Coloring,' ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 98-105,1982.
4. Frederick Chow and John Hennessy, Register Allocation by Priority-Based Coloring, Proc. of SIGPLAN 84 Symposium on Compiler Construction, pp. 222-232, Montreal, Quebec, 1984.
5. M. G. Norman and P. Moscato, A Competitive and Cooperative Approach to Complex Combinatorial Search, Proc. of the 20th Informatics and Operations Research Meeting, Buenos Aires, August 1991.
6. B. Preisleben and P. Merz, A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems," Proc. of the IEEE International Conference on Evolutionary Computation, pp. 616-621, 1996
7. D. A. Fotakis, S. D. Likothanassis and S. K. Stefanakos, An Evolutionary Annealing Approach to Graph Coloring, Lecture Notes in Computer Science, vol. 2037, pp. 120-129, 2001.
8. D. Brelaz, New Methods to Color the Vertices of a Graph, Communications of the ACM, vol. 22 no. 4, pp. 251-256, 1979.
9. P. Galinier and J.-K. Hao, Hybrid Evolutionary Algorithms for Graph Coloring, Journal of Combinatorial Optimization, vol. 3, no. 4, 379-397, 1999
10. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
11. R. Dorne and J. Hao, A New Genetic Local Search Algorithm for Graph Coloring, Springer Verlag, Lecture Notes in Computer Science, Vol. 1498, pp. 745-754, 1998.