Abstract
One of the strong impacts on runtime performance of a given code is the register allocation phase of compilation. It is crucial to provide aggressive and sophisticated register allocators for the embedded devices, where the excessive compilation time is tolerated because of its off-line nature. In this paper, we present a hybrid evolutionary algorithm for register allocation problem that combines genetic algorithms with a local search technique. Our algorithm exploits a novel, highly-specialized crossover operator that considers domain-specific information. Computational experiments performed on various synthetic benchmarks prove that our method significantly outperform the state-of-the-art algorithms with respect to all given comparison metrics on solution quality.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Briggs, P., Cooper, K., Kennedy, K., Torczon, L.: Coloring Heuristics for Register Allocation. In: Proc. of SIGPLAN 89 Conference on Programming Language Design and Implementation, Portland, Oregon, pp. 275–284 (1989)
Briggs, P., Cooper, K., Torczon, L.: Improvements to Graph Coloring Register Allocation. ACM Transactions on Programming Languages and Systems 16(3), 428–455 (1994)
Chaitin, G.J.: Register Allocation and Spilling via Graph Coloring. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 98–105 (1982)
Chow, F., Hennessy, J.: Register Allocation by Priority-Based Coloring. In: Proc. of SIGPLAN 84 Symposium on Compiler Construction, Montreal, Quebec, pp. 222–232 (1984)
Norman, M.G., Moscato, P.: A Competitive and Cooperative Approach to Complex Combinatorial Search. In: Proc. of the 20th Informatics and Operations Research Meeting, Buenos Aires (August 1991)
Freisleben, B., Merz, P.: A Genetic Local Search Algorithm for Solving Symmetric and Asymmetric Traveling Salesman Problems. In: Proc. of the IEEE International Conference on Evolutionary Computation, pp. 616–621 (1996)
Fotakis, D.A., Likothanassis, S.D., Stefanakos, S.K.: An Evolutionary Annealing Approach to Graph Coloring. In: Boers, E.J.W., Gottlieb, J., Lanzi, P.L., Smith, R.E., Cagnoni, S., Hart, E., Raidl, G.R., Tijink, H. (eds.) EvoIASP 2001, EvoWorkshops 2001, EvoFlight 2001, EvoSTIM 2001, EvoCOP 2001, and EvoLearn 2001. LNCS, vol. 2037, pp. 120–129. Springer, Heidelberg (2001)
Brelaz, D.: New Methods to Color the Vertices of a Graph. Communications of the ACM 22(4), 251–256 (1979)
Galinier, P., Hao, J.-K.: Hybrid Evolutionary Algorithms for Graph Coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)
Dorne, R., Hao, J.: A New Genetic Local Search Algorithm for Graph Coloring. In: Eiben, A.E., Bäck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol. 1498, pp. 745–754. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Demiroz, B., Topcuoglu, H., Kandemir, M. (2004). A Hybrid Evolutionary Algorithm for Solving the Register Allocation Problem. In: Gottlieb, J., Raidl, G.R. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2004. Lecture Notes in Computer Science, vol 3004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24652-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-24652-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21367-3
Online ISBN: 978-3-540-24652-7
eBook Packages: Springer Book Archive