Article

Register allocation for programs in SSA-Form

Authors:

Sebastian Hack,

Gerhard GoosAuthors Info & Claims

CC'06: Proceedings of the 15th international conference on Compiler Construction

Pages 247 - 262

https://doi.org/10.1007/11688839_20

Published: 30 March 2006 Publication History

Abstract

As register allocation is one of the most important phases in optimizing compilers, much work has been done to improve its quality and speed. We present a novel register allocation architecture for programs in SSA-form which simplifies register allocation significantly. We investigate certain properties of SSA-programs and their interference graphs, showing that they belong to the class of chordal graphs. This leads to a quadratic-time optimal coloring algorithm and allows for decoupling the tasks of coloring, spilling and coalescing completely. After presenting heuristic methods for spilling and coalescing, we compare our coalescing heuristic to an optimal method based on integer linear programming.

References

[1]

Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via graph coloring. Journal of Computer Languages 6 (1981) 45-57

[2]

Briggs, P., Cooper, K.D., Torczon, L.: Improvements to graph coloring register allocation. ACM Trans. Program. Lang. Syst. 16 (1994) 428-455

Digital Library

[3]

Golumbic, M.C.: Algorithmic Graph Theory And Perfect Graphs. Academic Press (1980)

[4]

Budimlić, Z., Cooper, K.D., Harvey, T.J., Kennedy, K., Oberg, T.S., Reeves, S.W.: Fast copy coalescing and live-range identification. In: Proceedings of the ACM SIGPLAN 2002 Conference on Programming language design and implementation, ACM Press (2002) 25-32

Digital Library

[5]

Bouchez, F.: Allocation de registres et vidage en mémoire. Master's thesis, ÉNS Lyon (2005)

[6]

Diestel, R.: Graph Theory. 3 edn. Volume 173 of Graduate Texts in Mathematics. Springer (2005)

[7]

Bergner, P., Dahl, P., Engebretsen, D., O'Keefe, M.: Spill code minimization via interference region spilling. In: PLDI '97: Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation, New York, NY, USA, ACM Press (1997) 287-295

Digital Library

[8]

Chow, F.C., Hennessy, J.L.: The priority-based coloring approach to register allocation. ACM Trans. Program. Lang. Syst. 12 (1990) 501-536

Digital Library

[9]

Hsu, W.C., Fisher, C.N., Goodman, J.R.: On the Minimization of Loads/Stores in Local Register Allocation. IEEE Trans. Softw. Eng. 15 (1989) 1252-1260

Digital Library

[10]

Guo, J., Garzaran, M.J., Padua, D.: The Power of Belady's Algorithm in Register Allocation for Long Basic Blocks. The 16th International Workshop on Languages and Compilers for Parallel Computing (2003)

[11]

Belady, L.: A Study of Replacement of Algorithms for a Virtual Storage Computer. IBM Systems Journal 5 (1966) 78-101

Digital Library

[12]

Cytron, R., Ferrante, J., Rosen, B.K., Wegman, M.N., Zadek, F.K.: Efficiently computing static single assignment form and the control dependence graph. ACM Transactions on Programming Languages and Systems 13 (1991) 451-490

Digital Library

[13]

Briggs, P., D.Cooper, K., Harvey, T.J., Simpson, L.T.: Practical Improvements to the Construction and Destruction of Static Single Assignment Form. Software: Practice and Experience 28 (1998) 859-881

Digital Library

[14]

Hack, S., Grund, D., Goos, G.: Towards Register Allocation for Programs in SSAform. Technical Report 2005-27, Universität Karlsruhe (2005)

[15]

Lindenmaier, G., Beck, M., Boesler, B., Geiß, R.: Firm, an intermediate language for compiler research. Technical Report 2005-8, University of Karlsruhe (2005)

[16]

George, L., Appel, A.W.: Iterated register coalescing. ACM Trans. Program. Lang. Syst. 18 (1996) 300-324

Digital Library

[17]

Park, J., Moon, S.M.: Optimistic register coalescing. ACM Trans. Program. Lang. Syst. 26 (2004) 735-765

Digital Library

[18]

Andersson, C.: Register Allocation By Optimal Graph Coloring. In Hedin, G., ed.: CC 2003. Volume 2622 of LNCS., Heidelberg, Springer-Verlag (2003) 33-45

Digital Library

[19]

Pereira, F.M.Q., Palsberg, J.: Register allocation via coloring of chordal graphs. In: Proceedings of APLAS'05. (2005)

Digital Library

[20]

Hack, S.: Interference Graphs of Programs in SSA-form. Technical Report 2005-15, Universität Karlsruhe (2005)

[21]

Brisk, P., Dabiri, F., Macbeth, J., Sarrafzadeh, M.: Polynomial time graph coloring register allocation. In: 14th International Workshop on Logic and Synthesis, ACM Press (2005)

Cited By

Chen YChen MHuang CTu CJacob DKjolstad F(2024)Accelerate RISC-V Instruction Set Simulation by Tiered JIT CompilationProceedings of the 16th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages10.1145/3689490.3690399(12-22)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3689490.3690399
VenkataKeerthy SJain SKundu AAggarwal RCohen AUpadrasta RVerbrugge CLhoták OShen X(2023)RL4ReAl: Reinforcement Learning for Register AllocationProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580273(133-144)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580273
Sugita SKoizumi TShioya RIrie HSakai SVerbrugge CLhoták OShen X(2023)A Sound and Complete Algorithm for Code Generation in Distance-Based ISAProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580263(73-84)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580263
Show More Cited By

Recommendations

Register Spilling and Live-Range Splitting for SSA-Form Programs
CC '09: Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009

Register allocation decides which parts of a variable's live range are held in registers and which in memory. The compiler inserts <em>spill code</em> to move the values of variables between registers and memory. Since fetching data from memory is much ...
Differential register allocation
Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Micro-architecture designers are very cautious about expanding the number of architected registers (also the register field), because increasing the register field adds to the code size, raises I-cache and memory pressure, complicates processor ...
Differential register allocation
PLDI '05: Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation

Micro-architecture designers are very cautious about expanding the number of architected registers (also the register field), because increasing the register field adds to the code size, raises I-cache and memory pressure, complicates processor ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

CC'06: Proceedings of the 15th international conference on Compiler Construction

March 2006

276 pages

ISBN:354033050X

Editors:
Alan Mycroft
Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, Cambridge, UK
,
Andreas Zeller
Computer Laboratory, Saarland University, 15 JJ Thomson Avenue, Cambridge, Germany

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 30 March 2006

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

63
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 12 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Chen YChen MHuang CTu CJacob DKjolstad F(2024)Accelerate RISC-V Instruction Set Simulation by Tiered JIT CompilationProceedings of the 16th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages10.1145/3689490.3690399(12-22)Online publication date: 17-Oct-2024
https://dl.acm.org/doi/10.1145/3689490.3690399
VenkataKeerthy SJain SKundu AAggarwal RCohen AUpadrasta RVerbrugge CLhoták OShen X(2023)RL4ReAl: Reinforcement Learning for Register AllocationProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580273(133-144)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580273
Sugita SKoizumi TShioya RIrie HSakai SVerbrugge CLhoták OShen X(2023)A Sound and Complete Algorithm for Code Generation in Distance-Based ISAProceedings of the 32nd ACM SIGPLAN International Conference on Compiler Construction10.1145/3578360.3580263(73-84)Online publication date: 17-Feb-2023
https://dl.acm.org/doi/10.1145/3578360.3580263
Khan SChatterjee BPande SRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)VICOProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532393(1-14)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532393
Canesche MFerreira RNacif JQuintão Pereira FEgger BSmith A(2022)A polynomial time exact solution to the bit-aware register binding problemProceedings of the 31st ACM SIGPLAN International Conference on Compiler Construction10.1145/3497776.3517773(29-40)Online publication date: 19-Mar-2022
https://dl.acm.org/doi/10.1145/3497776.3517773
Fujita NKobayashi RYamaguchi YBoku T(2022)Implementation and Performance Evaluation of Memory System Using Addressable Cache for HPC Applications on HBM2 Equipped FPGAsEuro-Par 2022: Parallel Processing Workshops10.1007/978-3-031-31209-0_9(121-132)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-31209-0_9
Lozano RCarlsson MBlindell GSchulte C(2019)Combinatorial Register Allocation and Instruction SchedulingACM Transactions on Programming Languages and Systems10.1145/333237341:3(1-53)Online publication date: 2-Jul-2019
https://dl.acm.org/doi/10.1145/3332373
Lozano RSchulte C(2019)Survey on Combinatorial Register Allocation and Instruction SchedulingACM Computing Surveys10.1145/320092052:3(1-50)Online publication date: 18-Jun-2019
https://dl.acm.org/doi/10.1145/3200920
Chen WLueh GAshar PChen KCheng BKnoop JSchordan MJohnson TO'Boyle M(2018)Register allocation for Intel processor graphicsProceedings of the 2018 International Symposium on Code Generation and Optimization10.1145/3168806(352-364)Online publication date: 24-Feb-2018
https://dl.acm.org/doi/10.1145/3168806
Maalej MPaisante VRamos PGonnord LPereira FReddi VSmith ATang L(2017)Pointer disambiguation via strict inequalitiesProceedings of the 2017 International Symposium on Code Generation and Optimization10.5555/3049832.3049848(134-147)Online publication date: 4-Feb-2017
https://dl.acm.org/doi/10.5555/3049832.3049848
Show More Cited By

View Options

View options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents