Solving the register allocation problem for embedded systems using a hybrid evolutionary algorithm

IEEE Transactions on Evolutionary Computation

Volumn 11, Issue 5, 2007, Pages 620-634

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

^a MARMARA UNIVERSITY   (Turkey)

^b PENNSYLVANIA STATE UNIVERSITY   (United States)

Author keywords

Compilers; Crossover; Embedded systems; Evolutionary algorithms (EAs); Hybridization; Register allocation

Indexed keywords

EMBEDDED SYSTEMS; GRAPHIC METHODS; HEURISTIC PROGRAMMING; PROGRAM COMPILERS; STORAGE ALLOCATION (COMPUTER);

CROSSOVER OPERATOR; GRAPH COLORING; REGISTER ALLOCATION;

EVOLUTIONARY ALGORITHMS;

EID: 34948822847     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2007.892766     Document Type: Article

References (49)

1. A. Chandrakasan and R. Brodersen, Low Power Digital CMOS Design. Norwell, MA: Kluwer, 1995.
2. A. Chandrakasan, W. J. Bowhill, and F. Fox, Design of High-Performance Microprocessor Circuits. Piscataway, NJ: IEEE Press, 2001.
3. T. Back, D. B. Fogel, and Z. Michalewicz, Handbook of Evolutionary Computation. New York: Inst. Physics and Oxford Univ. Press, 1997.
4. T. Back, Evolutionary Algorithms in Theory and Practice. New York: Oxford Univ. Press, 1996.
5. A. E. Eiben and J. E. Smith, Introduction to Evolutionary Computing Berlin, Germany: Springer-Verlag, 2003.
6. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
7. Z. Michalewicz and D. B. Fogel, How to Solve It: Modern Heuristics Berlin, Germany: Springer-Verlag, 2000.
8. B. R. Fox and M. B. McMahon, "Genetic operators for sequencing problems," in Foundations of Genetic Algorithms, First Workshop on the Foundation of Genetic Algorithms and Classifier Systems, G. Rawlins, Ed., 1990, Morgan Kaufmann.
9. J. J. Greffenstette, "Incorporating problem specific knowledge into a genetic algorithm," in Genetic Algorithms and Simulated Annealing L. Davis, Ed. San Mateo, CA: Morgan Kaufmann, 1987.
10. G. Raidl, "Hybrid evolutionary algorithms for combinatorial algorithms," Habilitation thesis, Vienna Univ. Technology, Vienna, Austria, 2002.
11. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms," Caltech, Pasadena, CA, Tech. Rep. Caltech Concurrent Computation Program Rep. 826, 1989.
12. P. Moscato, "Memetic algorithms," Home Page. [Online]. Available: http://www.ing.unlp.edu.ar/cetad/mos/memetic_home.html.
13. N. J. Radcliffe and P. D. Surry, "Formal memetic algorithms," in Proc. Evol. Comput.: AISB Workshop, 1994, vol. 865, LNCS, pp. 1-16.
14. R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 613-622, Dec. 2001.
15. B. Freisleben and P. Merz, "New genetic local search operators for the traveling salesman problem," Lecture Notes in Computer Science, vol. 1141, pp. 890-899, 1996.
16. V. Schnecke and O. Vornberger, "Hybrid genetic algorithms for constrained placement problems," IEEE Trans. Evol. Comput., vol. 1, no. 4, pp. 266-277, 1997.
17. C. R. Houck, J. A. Joines, and M. G. Kay, "Comparison of genetic algorithms, random search and two-opt switching for solving large location-allocation problems," Comput. Oper. Res., vol. 23, no. 6, pp. 587-596, 1996.
18. G. Magyar, M. Johnsson, and O. Nevalainen, "An adaptive hybrid genetic algorithm for the three-matching problem," IEEE Trans. Evol. Comput. vol. 4, no. 2, pp. 135-146, 2000.
19. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," J. Heuristics, vol. 2, no. 1, pp. 5-50, 1996.
20. G. Dozier, J. Bowen, and A. Homaifar, "Solving constraint satisfaction problems using hybrid evolutionary search," IEEE Trans. Evol. Comput., vol. 2, no. 1, pp. 23-33, 1998.
21. A. Ruiz-Andino, L. Araujo, F. Saenz, and J. Ruz, "A hybrid evolutionary approach for solving constrained optimization problems over finite domains," IEEE Trans. Evol. Comput., vol. 4, no. 4, pp. 353-372, 2000.
22. J. He, J. Xu, and X. Yao, "Solving equations by hybrid evolutionary computation techniques," IEEE Trans. Evol. Comput., vol. 4, no. 3, pp. 295-304, 2000.
23. P. Briggs, K. Cooper, K. Kennedy, and L. Torczon, "Coloring heuristics for register allocation," in Proc. SIGPLAN Conf. Programming Language Design and Implementation, Portland, OR, 1989, pp. 275-284.
24. P. Briggs, K. Cooper, and L. Torczon, "Improvements to graph coloring register allocation," ACM Trans. Programming Languages and Systems vol. 16, no. 3, pp. 428-455, 1994.
25. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA: Freeman, 1979.
26. K. D. Cooper and L. Torczon, Engineering a Compiler. San Mateo, CA: Morgan Kaufmann, 2004.
27. D. Brelaz, "New methods to color the vertices of a graph," Commun. ACM, vol. 22, no. 4, pp. 251-256, 1979.
28. C. Fleurent and J. Ferland, "Genetic and hybrid algorithms for graph coloring," Ann. Oper. Res., vol. 63, pp. 437-461, 1996.
29. Z.Kokosinski, M.Kolodziej, and K. Kwarciany, "Parallel genetic algorithm for graph coloring problem," in Proc. 4th Int. Conf. Comput. Sci., 2004, vol. 3036, Lecture Notes in Computer Science, pp. 217-224.
30. Z. Kokosinski, K. Kwarciany, and M. Kolodziej, "Efficient graph coloring with parallel genetic algorithms," Comput. Inform., vol. 24, pp. 1001-1025, 2005.
31. R. Dorne and J. Hao, A New Genetic Local Search Algorithm for Graph Coloring. Berlin, Germany: Springer-Verlag, 1998, vol. 1498, Lecture Notes in Computer Science, pp. 745-754.
32. 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.
33. P. Galinier and J.-K. Hao, "Hybrid evolutionary algorithms for graph coloring," J. Combinatorial Opt., vol. 3, no. 4, pp. 379-397, 1999.
34. G. J. Chaitin, M. A. Auslander, A. K. Chandra, J. Cocke, M. E. Hopplings, and P. W. Markstein, "Register allocation via coloring," Comput. Languages, vol. 6, pp. 47-57, 1981.
35. G. J. Chaitin, "Register allocation and spilling via graph coloring," in Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, 1982, pp. 98-105.
36. F. C. Chow and J. L. Hennessy, "Register allocation by priority-based coloring," in Proc. SIGPLAN Symp. Compiler Construction, Montreal, QC, Canada, 1984, pp. 222-232.
37. F. C. Chow and J. L. Hennessy, "The priority-based coloring approach to register allocation," ACM Trans. Programming Languages and Systems vol. 12, no. 4, pp. 501-536, 1990.
38. P. Pinter, "Register allocation with instruction scheduling: A new approach," in Proc. ACM SIGPLAN Conf. Programming Language Design and Implementation, 1993, pp. 248-257.
39. P. Pinter, "Register allocation with instruction scheduling: A new approach," J. Programming Language, vol. 4, pp. 21-38, 1996.
40. K. D. Cooper and L. Torczon, Lecture Slides. [Online]. Available: http:// www.owlnet.rice.edu/comp412/Lectures/
41. M. Mitchell, An Introduction to Genetic Algorithms. Cambridge, MA: MIT Press, 1998.
42. J. R. Koza, Genetic Programming: On the Programming of Computers by Means of Natural Selection. Cambridge, MA: MIT Press, 1992.
43. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proc. IEEE Int. Conf. Neural Netw., 1995, vol. IV, pp. 1942-1948.
44. M. Dorigo and G. Di Caro, "The ant colony optimization meta-heuristic," in New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, Eds. New York: McGraw-Hill, 1999.
45. T. R. Jensen and B. Toft, Graph Coloring Problems. New York: Wiley, 1995.
46. B. Demiroz, H. Topcuoglu, and M. Kandemir, "A hybrid evolutionary algorithm for solving the register allocation problem," Lecture Notes in Computer Science, vol. 3004, pp. 62-71, 2004.
47. M. Berry, D. Chen, P. Koss, D. Kuck, S. Lo, Y. Pang, L. Pointer, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D.Walker, and C. Hsiung et al., "The PERFECT club benchmarks: Effective performance evaluation of supercomputers," Int. J. Supercomput. Appl., vol. 3, no. 3, pp. 5-40, 1988.
48. Spec Benchmarks, Home Page. [Online]. Available: http://www.spec.org
49. F. McMohan, The Livermore Fortran Kernels: A computer test of the numerical performance range Lawrence Livermore Nat. Lab., Livermore, CA, Tech. Rep. UCRL-53745, Dec. 1986.