research-article

Allocating rotating registers by scheduling

Authors:

Youfeng WuAuthors Info & Claims

MICRO-46: Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

Pages 346 - 358

https://doi.org/10.1145/2540708.2540738

Published: 07 December 2013 Publication History

Abstract

A rotating alias register file is a scalable hardware support to detect memory aliases at run-time. It has been shown that it can enable instruction-level parallelism to be effectively exploited from sequential code. Yet it is unknown how to apply it to loops.

This paper presents an elegant and efficient solution that allocates rotating alias registers for a software-pipelined schedule of a loop. We show that surprisingly, this specific register allocation problem can be reduced to another software pipelining problem, for which numerous efficient algorithms are available. This is interesting in both theory and practice. We propose an algorithmic framework to solve the problem. We also present a simple software pipelining algorithm that specially targets register allocation. Comparison with a few other algorithms shows that it usually achieves the best allocation at the least time cost.

Finally, we generalize the approach to allocate general-purpose (integer/floating-point/predicate) rotating registers by showing that it is also a software pipelining problem.

References

[1]

Intel ia-64 architecture software developer's manual, 2000. Vol. 1.

[2]

W. Ahn, Y. Duan, and J. Torrellas. Dealiaser: alias speculation using atomic region support. In ASPLOS'13, pages 167--180, 2013.

Digital Library

[3]

J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren. Conversion of control dependence to data dependence. In POPL'83, pages 177--189, 1983.

Digital Library

[4]

P.-Y. Calland, A. Darte, and Y. Robert. Circuit retiming applied to decomposed software pipelining. IEEE Trans. Parallel Distrib. Syst., 9(1):24--35, 1998.

Digital Library

[5]

G. J. Chaitin. Register allocation & spilling via graph coloring. SIGPLAN Not., 17(6):98--101, June 1982.

Digital Library

[6]

L.-F. Chao, A. S. LaPaugh, and E. H.-M. Sha. Rotation scheduling: a loop pipelining algorithm. IEEE Trans. Comp.-Aided Des. Integ. Cir. Sys., 16(3):229--239, Nov. 2006.

Digital Library

[7]

J. C. Dehnert, B. K. Grant, J. P. Banning, R. Johnson, T. Kistler, A. Klaiber, and J. Mattson. The transmeta code morphing software: using speculation, recovery, and adaptive retranslation to address real-life challenges. In CGO'03, pages 15--24, 2003.

Digital Library

[8]

J. C. Dehnert and R. A. Towle. Compiling for the cydra 5. J. Supercomput., 7(1-2): 181--227, May 1993.

Digital Library

[9]

F. Gasperoni and U. Schwiegelshohn. Generating close to optimum loop schedules on parallel processors. Parallel Processing Letters, 4(4):391--403, 1994.

[10]

M. Lam. Software pipelining: an effective scheduling technique for vliw machines. In PLDI'88, pages 318--328, 1988.

Digital Library

[11]

S. A. Mahlke, D. C. Lin, W. Y. Chen, R. E. Hank, and R. A. Bringmann. Effective compiler support for predicated execution using the hyperblock. In MICRO 25, pages 45--54, 1992.

Digital Library

[12]

N. Neelakantam, D. R. Ditzel, and C. Zilles. A real system evaluation of hardware atomicity for software speculation. SIGARCH Comput. Archit. News, 38(1):29--38, Mar. 2010.

Digital Library

[13]

B. R. Rau and C. D. Glaeser. Some scheduling techniques and an easily schedulable horizontal architecture for high performance scientific computing. In MICRO 14, pages 183--198, 1981.

Digital Library

[14]

B. R. Rau, M. Lee, P. P. Tirumalai, and M. S. Schlansker. Register allocation for software pipelined loops. SIGPLAN Not., 27(7):283--299, July 1992.

Digital Library

[15]

M. E. Richter, D. J. Poeschl, and T. W. O'Neil. New heuristics for rotation scheduling. In Int'l Conf. Parallel Distributed Processing Tech. Appl., 2008.

[16]

H. Rong, A. Douillet, and G. R. Gao. Register allocation for software pipelined multi-dimensional loops. In PLDI'05, pages 154--167, 2005.

Digital Library

[17]

A. Rădulescu and A. J. C. van Gemund. On the complexity of list scheduling algorithms for distributed-memory systems. In ICS'99, pages 68--75, 1999.

Digital Library

[18]

J. Ruttenberg, G. R. Gao, A. Stoutchinin, and W. Lichtenstein. Software pipelining showdown: optimal vs. heuristic methods in a production compiler. In PLDI'96, pages 1--11, 1996.

Digital Library

[19]

C. Wang, Y. Wu, H. Rong, and H. Park. Smartq: Software-managed alias register queue for dynamic optimizations. In MICRO 45, pages 425--436, 2012.

Digital Library

[20]

J. Wang, C. Eisenbeis, M. Jourdan, and B. Su. Decomposed software pipelining: a new perspective and a new approach. Int. J. Parallel Program., 22(3):351--373, June 1994.

Digital Library

Cited By

Ghosh SPark YRaman A(2015)Enabling Efficient Alias SpeculationACM SIGPLAN Notices10.1145/2808704.275496450:5(1-10)Online publication date: 4-Jun-2015
https://dl.acm.org/doi/10.1145/2808704.2754964
Ghosh SPark YRaman ANoh SFischmeister SXue J(2015)Enabling Efficient Alias SpeculationProceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM10.1145/2670529.2754964(1-10)Online publication date: 4-Jun-2015
https://dl.acm.org/doi/10.1145/2670529.2754964
Rong HPark HWu YWang C(2014)Just-In-Time Software PipeliningProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2581122.2544148(11-22)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2581122.2544148
Show More Cited By

Index Terms

Allocating rotating registers by scheduling
1. Software and its engineering
  1. Software notations and tools
    1. Compilers

Recommendations

Allocating architected registers through differential encoding

Micro-architecture designers are very cautious about expanding the number of architected and exposed registers in the instruction set because increasing the register field adds to the code size, raises the I-cache and memory pressure, and may complicate ...
Rotating register allocation with multiple rotating branches
ICS '08: Proceedings of the 22nd annual international conference on Supercomputing

A rotating register file is an architectural support for software pipelining, where many registers can be renamed at once when a rotating branch is executed. It has primarily been used for overcoming the cross-iteration register overwrites in modulo-...
Efficient Spilling Reduction for Software Pipelined Loops in Presence of Multiple Register Types in Embedded VLIW Processors

Integrating register allocation and software pipelining of loops is an active research area. We focus on techniques that precondition the dependence graph before software pipelining in order to ensure that no register spill instructions are inserted by ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

MICRO-46: Proceedings of the 46th Annual IEEE/ACM International Symposium on Microarchitecture

December 2013

498 pages

ISBN:9781450326384

DOI:10.1145/2540708

General Chair:
Matthew Farrens
UC Davis
,
Program Chair:
Christos Kozyrakis
Stanford University

Copyright © 2013 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: 07 December 2013

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

MICRO-46

Sponsor:

SIGMICRO

MICRO-46: The 46th Annual IEEE/ACM International Symposium on Microarchitecture

December 7 - 11, 2013

California, Davis

Acceptance Rates

MICRO-46 Paper Acceptance Rate 39 of 239 submissions, 16%;

Overall Acceptance Rate 484 of 2,242 submissions, 22%

Upcoming Conference

MICRO '24

Sponsor:
sigmicro

57th Annual IEEE/ACM International Symposium on Microarchitecture

November 2 - 6, 2024

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
340
Total Downloads

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

Reflects downloads up to 10 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Ghosh SPark YRaman A(2015)Enabling Efficient Alias SpeculationACM SIGPLAN Notices10.1145/2808704.275496450:5(1-10)Online publication date: 4-Jun-2015
https://dl.acm.org/doi/10.1145/2808704.2754964
Ghosh SPark YRaman ANoh SFischmeister SXue J(2015)Enabling Efficient Alias SpeculationProceedings of the 16th ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2015 CD-ROM10.1145/2670529.2754964(1-10)Online publication date: 4-Jun-2015
https://dl.acm.org/doi/10.1145/2670529.2754964
Rong HPark HWu YWang C(2014)Just-In-Time Software PipeliningProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2581122.2544148(11-22)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2581122.2544148
Rong HPark HWu YWang C(2014)Just-In-Time Software PipeliningProceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization10.1145/2544137.2544148(11-22)Online publication date: 15-Feb-2014
https://dl.acm.org/doi/10.1145/2544137.2544148

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

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents