Cited By
View all- Chu-Carroll MPollock L(2005)Design and implementation of a general purpose parallel programming systemHigh-Performance Computing and Networking10.1007/3-540-61142-8_589(499-507)Online publication date: 18-Aug-2005
Achieving efficient register allocation via parallelism
Pages 123 - 129
References
[1]
P. Briggs, K. D. Cooper, K. Kennedy, and L. Torczon. Coloring heuristics for register allocation. In Proceedings of the ACM SIGPLAN '89 Conference on Programming Language Design and Implementation, July 1989.
[2]
Preston Briggs, Keith D. Cooper, and Linda Torczon. Rematerialization. In Proceedings of the SIGPLAN'92 Conference on Programming Language Design and Implementation, June 1992.
[3]
David CaUahan and Brian Koblenz. Register allocation via hierarchical graph coloring. In Proceedingsofthe SIGPLAN '91 Conference on Programming Language Design and Implementation, pages 192--203, June 1991.
[4]
Nicholas Carriero and David Gelemter. How to Write Parallel Programs. MIT Press, 1991.
[5]
G. J. Chaitin. Register allocation and spilling via graph coloring. In ACM SIGPLAN Symposium on Compiler Con. struction, June 1982.
[6]
Gregory Chaitin, Marc Auslander, Ashok K. Chandra, John Cocke, Martin E. Hopkins, and Peter W. Markstein. Register allocation via coloring. Computer Languages, 6:47--57, January 1981.
[7]
Frederick Chow and John Hennessy. The priority-based coloring approach to register allocation. ACM Transactions on Programming Languages and Systems, 12:501-536, October 1990.
[8]
R. Gupta and M. L. Sofia. Register allocation via clique separators. In ACM SIGPLAN Programming Language Design and Implementation Conference, pages 264--274, 1989.
[9]
Rajiv Gupta, Mary Lou Sofia, and Denise Ombres. Efficient register allocation via coloring using clique separators. ACM Transactions on Prograrmning Languages and Systems, 16(3):370-386, May 1994.
[10]
W. Hsu, C. Fischer, and J. Goodman. On the minimization of loads/stores in local register allocation. IEEE Transactions on Software Engineering, 15(10), October 1989.
[11]
J. R. Larus and P. N. Hilfmger. Register allocation in the spur lisp compiler. In Proceedings of the ACM SIGPLAN '86 Symposium on Compiler Construction, pages 255--263, 1986.
[12]
Todd A. Proebsting and Charles N. Fischer. Probabilistic register allocation, in Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, pages 300--310, 1992.
[13]
Ravi Sethi. Complete register allocation problems. SIAM Journal on Computing, 4:226--248, 1975.
[14]
R.E. Tarjan. Decomposition by clique separators. Discrete Mathematics, 55:221--231, 1985.
[15]
Angelika Zobel. PrograrnStructure as a Basis for the ParaUelization of Global Compiler Optinu'zations. PhD thesis, Dept. of Computer Science, Carnegie Mellon University, Pittsburgh, PA, May 1992.
[16]
Angelika Zobel. Program structure as basis for paraUelizing global register allocation. In International Conference on Computer Languages, 1992.
Index Terms
- Achieving efficient register allocation via parallelism
Recommendations
Parallel trace register allocation
ManLang '18: Proceedings of the 15th International Conference on Managed Languages & RuntimesRegister allocation is a mandatory task for almost every compiler and consumes a significant portion of compile time. In a just-in-time compiler, compile time is a particular issue because compilation happens during program execution and contributes to ...
Efficient register allocation via coloring using clique separators
Although graph coloring is widely recognized as an effective technique for register allocation, memory demands can become quite high for large interference graphs that are needed in coloring. In this paper we present an algorithm that uses the notion of ...
Program structure as basis for the parallelization of global register allocation
We propose a model for global register allocation via graph coloring that uses knowledge about program structure to guide global register allocation. We define restrictions that must be met by the live ranges of loops and conditionals such that the ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
February 1995
604 pages
ISBN:0897916581
DOI:10.1145/315891
- Chairmen:
- Jim Hightower,
- Ed Deaton,
- Editors:
- K. M. George,
- Janice Carroll,
- Dave Oppenheim
Copyright © 1995 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
- SIGAPP: ACM Special Interest Group on Applied Computing
- SIGBIOM: ACM Special Interest Group on Biomedical Computing
- SIGPLAN: ACM Special Interest Group on Programming Languages
- SIGCUE: ACM Special Interest Group on Computer Uses In Education
- SIGAda: ACM Special Interest Group on Ada Programming Language
- SIGICE: ACM Special Interest Group on Individual Computing Environment
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 February 1995
Check for updates
Author Tags
Qualifiers
- Article
Conference
Acceptance Rates
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 341Total Downloads
- Downloads (Last 12 months)48
- Downloads (Last 6 weeks)6
Reflects downloads up to 16 Nov 2024
Other Metrics
Citations
Cited By
View all- Chu-Carroll MPollock L(2005)Design and implementation of a general purpose parallel programming systemHigh-Performance Computing and Networking10.1007/3-540-61142-8_589(499-507)Online publication date: 18-Aug-2005
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in