Skip to main content
SpringerLink
Log in

Register Allocation via Graph Coloring Using an Evolutionary Algorithm

  • Conference paper
Swarm, Evolutionary, and Memetic Computing (SEMCCO 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7077))

Included in the following conference series:

Abstract

Register allocation is one of most important compiler optimization techniques. The most famous method for register allocation is graph coloring and the solution presented in this paper (RAGCES) is based on the graph coloring too; for coloring interference graph, evolutionary algorithm is used. In this method graph coloring and selecting variables for spilling is taken place at the same time. This method was tested on several graphs and results were compared with the results of the previous methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)

    MATH  Google Scholar 

  2. Beaty, S.J.: Register Allocation and Assignment in a Retargetable Microcode Compiler Using Graph Coloring. Colorado State University (1987)

    Google Scholar 

  3. Cooper, K.D., Dasgupta, A.: Tailoring Graph-Coloring Register Allocation for Runtime Compilation. IEEE Computer Society (2006)

    Google Scholar 

  4. Chaitin, G.: Register Allocation and Spilling via Graph Coloring. In: Sigplan 1982 (1982)

    Google Scholar 

  5. Chow, F.C., Hennessy, J.L.: The Priority-Based Coloring Approach to Register Allocation. ACM (1990)

    Google Scholar 

  6. Chaitin, G., Auslander, M., Chandra, A., Cocke, J., Hopkins, M., Markstein, P.: Register Allocation via Coloring. Computer Languages, 45–57 (1981)

    Google Scholar 

  7. Briggs, P.: Register allocation via graph coloring, Phd thesis, Rice University, Houston, USA (1992)

    Google Scholar 

  8. Wu, S., Li, S.: Extending Traditional Graph-Coloring Register Allocation exploiting Meta-heuristics for Embedded Systems. IEEE Computer Society (2007)

    Google Scholar 

  9. Topcuoglu, H.R., Demiroz, B., Kandemir, M.: Solving the Register Allocation Problem for Embedded Systems Using a Hybrid Evolutionary Algorithm. IEEE Transaction on Evolutionary Computation 11(5) (October 2007)

    Google Scholar 

  10. Hack, S., Goos, G.: Optimal Register Allocation for SSA-form programs in polynomial time. Information Processing Letters 98, 150–155 (2006)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer, Shabestar Branch, Islamic Azad University, Shabestar, Iran

    Sevin Shamizi

  2. Computer Science Department, University of Tabriz, Tabriz, Iran

    Shahriar Lotfi

Authors
  1. Sevin Shamizi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Shahriar Lotfi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering, IIT, Delhi, India

    Bijaya Ketan Panigrahi

  2. School of Electrical and Electronic Engineering, Nanyang Technological University, 639798, Singapore

    Ponnuthurai Nagaratnam Suganthan

  3. Department of Electronics and Telecommunications, Jadavpur University, 700032, Kolkata, India

    Swagatam Das

  4. ANITS, Visakhapatnam, India

    Suresh Chandra Satapathy

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shamizi, S., Lotfi, S. (2011). Register Allocation via Graph Coloring Using an Evolutionary Algorithm. In: Panigrahi, B.K., Suganthan, P.N., Das, S., Satapathy, S.C. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2011. Lecture Notes in Computer Science, vol 7077. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27242-4_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27242-4_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27241-7

  • Online ISBN: 978-3-642-27242-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation