research-article

Combinatorial spill code optimization and ultimate coalescing

Authors:

Roberto Castañeda Lozano,

Gabriel Hjort Blindell,

Christian SchulteAuthors Info & Claims

LCTES '14: Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

Pages 23 - 32

https://doi.org/10.1145/2597809.2597815

Published: 12 June 2014 Publication History

Abstract

This paper presents a novel combinatorial model that integrates global register allocation based on ultimate coalescing, spill code optimization, register packing, and multiple register banks with instruction scheduling (including VLIW). The model exploits alternative temporaries that hold the same value as a new concept for ultimate coalescing and spill code optimization.

The paper presents Unison as a code generator based on the model and advanced solving techniques using constraint programming. Thorough experiments using MediaBench and a processor (Hexagon) that are typical for embedded systems demonstrate that Unison: is robust and scalable; generates faster code than LLVM (up to 41% with a mean improvement of 7%); possibly generates optimal code (for 29% of the experiments); effortlessly supports different optimization criteria (code size on par with LLVM).

Unison is significant as it addresses the same aspects as traditional code generation algorithms, yet is based on a simple integrated model and robustly can generate optimal code.

References

[1]

A. W. Appel and L. George. Optimal spilling for CISC machines with few registers. SIGPLAN Not., 36:243--253, May 2001.

Digital Library

[2]

S. Bashford and R. Leupers. Phase-coupled mapping of data flow graphs to irregular data paths. Design Automation for Embedded Systems, pages 119--165, Mar. 1999.

[3]

R. Castañeda Lozano, M. Carlsson, F. Drejhammar, and C. Schulte. Constraint-based register allocation and instruction scheduling. In CP, volume 7514 of LNCS, pages 750--766. Springer, 2012.

Digital Library

[4]

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

Digital Library

[5]

C.-M. Chang, C.-M. Chen, and C.-T. King. Using integer linear programming for instruction scheduling and register allocation in multiissue processors. Computers Math. Applic., 34:1--14, Nov. 1997.

[6]

F. Chow and J. Hennessy. Register allocation by priority-based coloring. SIGPLAN Not., 19(6):222--232, June 1984.

Digital Library

[7]

M. V. Eriksson, O. Skoog, and C. W. Kessler. Optimal vs. heuristic integrated code generation for clustered VLIW architectures. In SCOPES, 2008.

[8]

C. H. Gebotys. An efficient model for DSP code generation: Performance, code size, estimated energy. In ISSS, pages 41--47. IEEE, 1997.

Digital Library

[9]

Gecode Team. Gecode: generic constraint development environment. www.gecode.org, 2006.

[10]

D. W. Goodwin and K. D. Wilken. Optimal and near-optimal global register allocations using 0--1 integer programming. Software -- Practice and Experience, 26:929--965, Aug. 1996.

Digital Library

[11]

D. Kästner. PROPAN: A retargetable system for postpass optimisations and analyses. In LCTES, volume 1985 of LNCS, 2001.

[12]

P. K. Krause. Optimal register allocation in polynomial time. In CC, volume 7791 of LNCS, pages 1--20. Springer, 2013.

Digital Library

[13]

C. Lee, M. Potkonjak, and W. H. Mangione-Smith. MediaBench: A tool for evaluating and synthesizing multimedia and communications systems. In MICRO-30, pages 330--335. IEEE, 1997.

Digital Library

[14]

S. G. Nagarakatte and R. Govindarajan. Register allocation and optimal spill code scheduling in software pipelined loops using 0--1 integer linear programming formulation. In CC, volume 4420 of LNCS, pages 126--140. Springer, 2007.

Digital Library

[15]

Hexagon V4 Programmer's Reference Manual. Qualcomm Technologies, Inc., Aug. 2013.

[16]

B. R. Rau and J. A. Fisher. Instruction-level parallel processing: history, overview, and perspective. J. Supercomput., 7:9--50, May 1993.

Digital Library

[17]

F. Rossi, P. van Beek, and T. Walsh. Handbook of Constraint Programming. Elsevier, 2006.

Digital Library

[18]

B. Scholz and E. Eckstein. Register allocation for irregular architectures. SIGPLAN Not., 37:139--148, June 2002.

Digital Library

[19]

V. Sreedhar, R. Ju, D. Gillies, and V. Santhanam. Translating out of static single assignment form. In SAS, volume 1694 of LNCS, pages 849--849. Springer, 1999.

Digital Library

[20]

T. Wilson, G. Grewal, B. Halley, and D. Banerji. An integrated approach to retargetable code generation. In ISSS, pages 70--75. IEEE, 1994.

Digital Library

[21]

T. Wilson, G. Grewal, S. Henshall, and D. Banerji. An ILP-based approach to code generation. In Code Generation for Embedded Processors, pages 103--118. Springer, 2002.

[22]

S. Winkel. Optimal versus heuristic global code scheduling. In MICRO-40, pages 43--55. IEEE, 2007.

Digital Library

Cited By

Giesemann FGerlach LPayá-Vayá G(2020)Evolutionary Algorithms for Instruction Scheduling, Operation Merging, and Register Allocation in VLIW CompilersJournal of Signal Processing Systems10.1007/s11265-019-01493-2Online publication date: 17-Jan-2020
https://doi.org/10.1007/s11265-019-01493-2
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
Show More Cited By

Index Terms

Combinatorial spill code optimization and ultimate coalescing
1. Software and its engineering
  1. Software notations and tools
    1. Compilers
      1. Source code generation
    2. General programming languages
      1. Language types
        Constraint and logic languages

Recommendations

Combinatorial Register Allocation and Instruction Scheduling

This article introduces a combinatorial optimization approach to register allocation and instruction scheduling, two central compiler problems. Combinatorial optimization has the potential to solve these problems optimally and to exploit processor-...
Combinatorial spill code optimization and ultimate coalescing
LCTES '14

This paper presents a novel combinatorial model that integrates global register allocation based on ultimate coalescing, spill code optimization, register packing, and multiple register banks with instruction scheduling (including VLIW). The model ...
Evaluating Register Allocation and Instruction Scheduling Techniques in Out-Of-Order Issue Processors
PACT '99: Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques

The phase ordering of register allocation and instruction scheduling in a compiler and their integration have been well studied for in-order issue and VLIW processors. In this paper we study this problem in the context of out-of-order issue processors. ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

LCTES '14: Proceedings of the 2014 SIGPLAN/SIGBED conference on Languages, compilers and tools for embedded systems

June 2014

174 pages

ISBN:9781450328777

DOI:10.1145/2597809

General Chair:
Youtao Zhang
University of Pittsburgh, USA
,
Program Chair:
Prasad Kulkarni
University of Kansas, USA

ACM SIGPLAN Notices Volume 49, Issue 5
LCTES '14
May 2014
162 pages
ISSN:0362-1340
EISSN:1558-1160
DOI:10.1145/2666357
Editors:
Mark W. Bailey
Hamilton College, Clinton, NY
,
Rajeev Balasubramonian
University of Utah
,
Al Davis
University of Utah
,
Sarita Adve
University of Illinois at Urbana-Champ
Issue’s Table of Contents

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 June 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Vetenskapsrädet

Conference

LCTES '14

Sponsor:

LCTES '14: SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014

June 12 - 13, 2014

Edinburgh, United Kingdom

Acceptance Rates

LCTES '14 Paper Acceptance Rate 16 of 51 submissions, 31%;

Overall Acceptance Rate 116 of 438 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
190
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Giesemann FGerlach LPayá-Vayá G(2020)Evolutionary Algorithms for Instruction Scheduling, Operation Merging, and Register Allocation in VLIW CompilersJournal of Signal Processing Systems10.1007/s11265-019-01493-2Online publication date: 17-Jan-2020
https://doi.org/10.1007/s11265-019-01493-2
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
Blindell GCarlsson MLozano RSchulte C(2017)Complete and Practical Universal Instruction SelectionACM Transactions on Embedded Computing Systems10.1145/312652816:5s(1-18)Online publication date: 27-Sep-2017
https://dl.acm.org/doi/10.1145/3126528
Lozano RCarlsson MBlindell GSchulte CZaks AHermenegildo M(2016)Register allocation and instruction scheduling in UnisonProceedings of the 25th International Conference on Compiler Construction10.1145/2892208.2892237(263-264)Online publication date: 17-Mar-2016
https://dl.acm.org/doi/10.1145/2892208.2892237
Arslan MGruian FKuchcinski KKarlsson A(2016)Code generation for a SIMD architecture with custom memory organisation2016 Conference on Design and Architectures for Signal and Image Processing (DASIP)10.1109/DASIP.2016.7853802(90-97)Online publication date: Oct-2016
https://doi.org/10.1109/DASIP.2016.7853802
Arslan MKuchcinski KGruian FLiu Y(2015)Programming support for reconfigurable custom vector architecturesProceedings of the Sixth International Workshop on Programming Models and Applications for Multicores and Manycores10.1145/2712386.2712399(49-57)Online publication date: 7-Feb-2015
https://dl.acm.org/doi/10.1145/2712386.2712399
Kessler C(2018)Compiling for VLIW DSPsHandbook of Signal Processing Systems10.1007/978-3-319-91734-4_27(979-1020)Online publication date: 14-Oct-2018
https://doi.org/10.1007/978-3-319-91734-4_27
Lozano RCarlsson MBlindell GSchulte CZaks AHermenegildo M(2016)Register allocation and instruction scheduling in UnisonProceedings of the 25th International Conference on Compiler Construction10.1145/2892208.2892237(263-264)Online publication date: 17-Mar-2016
https://dl.acm.org/doi/10.1145/2892208.2892237
Hjort Blindell GCastañeda Lozano RCarlsson MSchulte C(2015)Modeling Universal Instruction SelectionPrinciples and Practice of Constraint Programming10.1007/978-3-319-23219-5_42(609-626)Online publication date: 13-Aug-2015
https://doi.org/10.1007/978-3-319-23219-5_42

View Options

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten