Abstract
Register allocation is one of the most important issues in compiler optimization because a smart allocator can improve the quality of a code by nearly 250%. It is a significant optimization that has an impact on how well-compiled code performs. Also, it is one of the most researched issues in compiler theory, and there are numerous different strategies available to resolve it. This study compares several register allocation strategies.
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
References
Kindson The Tech Pro (2015) Register Allocation Via Graph Coloration,” YouTube, Aug. 19, 2015 [Video file]. Retrieved from https://www.youtube.com/watch?v=aMzcKTR5E1U&t=766s. Accessed on 31 Mar 2023
Register Allocation (via graph coloring). web.cecs.pdx.edu. Retrieved from http://web.cecs.pdx.edu/~mperkows/temp/register-allocation.pdf., last accessed 2023/03/31.
Bernice H (2023) Register allocation. Retrieved from http://technodocbox.com/. http://technodocbox.com/C_and_CPP/125816567-Lecture-26register-allocation.html. last accessed 2023/03/31.
Fernando Magno Quint˜ao Pereira F (2008) A survey on register allocation. In: A survey on register allocation, UCLA compilers group
Gregory JC, Mark AA, Ashok KC, John C, Martin EH, Peter WM (1981) Register allocation via coloring. Comput Lang 6:47–57
Preston B, Keith DC, Linda T (1994) Improvements to graph coloring register allocation. ACM Transact Programm Lang Syst VCI116(3):428–455
Anne Berry F, Jean B, Pinar H, Barry P (2004) Maximum cardinality search for computing minimal triangulations of graphs. Algorithmica 39(4):287–298
Massimiliano P, Vivek S (1999) Linear scan register allocation. ACM Transact Programm Lang Syst 21(5):895–913
Hongbo R (2019) Tree Register Allocation, Copyright ACM 978–1–60558–798–1/09/12
Guei-Yuan L, Thomas G, Ali-Reza AT (2000) Fusion-based register allocation. ACM Transact Programm Lang Syst 22(3)
Andrew P (2023) Algorithms for Register Allocation. courses.cs.washington.edu. Retrieved from https://courses.cs.washington.edu/courses/csep521/07wi/prj/pardoe.docx. Accessed on 31 Mar 2023
“Global Register Allocation via Graph Coloring.” people.cs.umass.edu. Retrieved from https://people.cs.umass.edu/~moss/610slides/37.pdf. Accessed on 31 Mar 2023
Josef EJ (2015) Trace Register Allocation, SPLASH Companion’15, 5 ACM. 978–1–4503–3722–9/15/10 https://doi.org/10.1145/2814189.2814199, October 25–30
Acknowledgements
We wish to express our sincere gratitude to the Principal, HOD and faculty of Cummins College of Engineering and Dr. Uday Khedkar Sir for their constant guidance and encouragement.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Amin, G., Dorkhande, G., Ogale, M., Mane, A., Gosavi, C. (2023). A Comparative Study of Register Allocation Algorithms. In: Fong, S., Dey, N., Joshi, A. (eds) ICT Analysis and Applications. ICT4SD 2023. Lecture Notes in Networks and Systems, vol 782. Springer, Singapore. https://doi.org/10.1007/978-981-99-6568-7_3
Download citation
DOI: https://doi.org/10.1007/978-981-99-6568-7_3
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-99-6567-0
Online ISBN: 978-981-99-6568-7
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)