Abstract
The introduction of a hardware managed register stack in the Itanium Architecture creates an opportunity to optimize both the frequency in which a compiler requests allocation of registers from this stack and the number of registers requested. The Itanium Architecture specifies the implementation of a Register Stack Engine (RSE) that automatically performs register spills and fills. However, if the compiler requests too many registers, through the alloc instruction, the RSE will be forced to execute unnecessary spill and fill operations. In this paper we introduce the formulation of the fine-grain register stack frame sizing problem. The normal interaction between the compiler and the RSE suggested by the Itanium Architecture designers is for the compiler to request the maximum number of registers required by a procedure at the procedure invocation. Our new problem formulation allows for more conservative stack register allocation because it acknowledges that the number of registers required in different control flow paths varies significantly. We introduce a basic algorithm to solve the stack register allocation problem, and present our preliminary performance results from the implementation of our algorithm in the Open64 compiler.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Open research compiler for itanium processors (January 2002), http://ipf-orc.sourceforge.net/
Open64 compiler and tools (January 2002), http://open64.sourceforge.net/
Callahan, D., Koblenz, B.: Register allocation via hierarchical graph coloring. In: SIGPLAN 1991 Conference on Programming Language Design and Implementation, Toronto, ON, June 1991, pp. 192–203 (1991)
Chaitin, G.J.: Register allocation & spilling via graph coloring. In: SIGPLAN 1982 Symposium on Compiler Construction, June 1982, pp. 98–105 (1982)
Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Transactions on Programming Language and Systems 12(4), 501–536 (1990)
Intel Corporation. Intel Itanium Architecture Software Manual vol. 1-4, revision 2.0 (December 2001)
Intel Corporation. Intel Itanium Processor Reference Manual for Software Development, revision 2.0 (December 2001)
Intel Corporation. Intel Itanium Processor Reference Manual for Software Optimization (November 2001), http://developer.intel.com/design/itanium/
Govindarajan, R., Yang, H., Amaral, J.N., Zhang, C., Gao, G.R.: Minimum register instruction sequence problem: Revisiting optimal code generation for dags. In: 15th International Parallel and Distributed Processing Symposium, San Francisco, CA (April 2001)
Govindarajan, R., Yang, H., Amaral, J.N., Zhang, C., Gao, G.R.: Minimum register instruction sequencing to reduce register spills in out-of-order issue superscalar architectures. IEEE Transactions on Computers (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Douillet, A., Amaral, J.N., Gao, G.R. (2005). Fine-Grain Stacked Register Allocation for the Itanium Architecture. In: Pugh, B., Tseng, CW. (eds) Languages and Compilers for Parallel Computing. LCPC 2002. Lecture Notes in Computer Science, vol 2481. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11596110_23
Download citation
DOI: https://doi.org/10.1007/11596110_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30781-5
Online ISBN: 978-3-540-31612-1
eBook Packages: Computer ScienceComputer Science (R0)