Achieving efficient register allocation via parallelism

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Achieving efficient register allocation via parallelism

Full text

Pdf (878 KB)

Source

Symposium on Applied Computing archive
Proceedings of the 1995 ACM symposium on Applied computing table of contents

Nashville, Tennessee, United States

Pages: 123 - 129

Year of Publication: 1995

ISBN:0-89791-658-1

Authors

Christine Makowski	University of Delaware
Lori L. Pollock	University of Delaware

Sponsors

SIGBIO: ACM Special Interest Group on Biomedical Computing
SIGADA: ACM Special Interest Group on Ada Programming Language
SIGCUE: ACM Special Interest Group on Computer Uses In Education
SIGICE: ACM Special Interest Group on Individual Computing Environment
SIGAPP: ACM Special Interest Group on Applied Computing
SIGPLAN: ACM Special Interest Group on Programming Languages

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 10, Citation Count: 0

Additional Information:

references index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/315891.315935 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	P. Briggs , K. D. Cooper , K. Kennedy , L. Torczon, Coloring heuristics for register allocation, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.275-284, June 19-23, 1989, Portland, Oregon, United States
	2	Preston Briggs , Keith D. Cooper , Linda Torczon, Rematerialization, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.311-321, June 15-19, 1992, San Francisco, California, United States
	3	David Callahan , Brian Koblenz, Register allocation via hierarchical graph coloring, Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, p.192-203, June 24-28, 1991, Toronto, Ontario, Canada
	4	Nicholas Carriero , David Gelernter, How to write parallel programs: a first course, MIT Press, Cambridge, MA, 1990
	5	G. J. Chaitin, Register allocation & spilling via graph coloring, Proceedings of the 1982 SIGPLAN symposium on Compiler construction, p.98-105, June 23-25, 1982, Boston, Massachusetts, United States
	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	Fred C. Chow , John L. Hennessy, The priority-based coloring approach to register allocation, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.4, p.501-536, Oct. 1990 [doi>10.1145/88616.88621]
	8	R. Gupta , M. L. Soffa , T. Steele, Register allocation via clique separators, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.264-274, June 19-23, 1989, Portland, Oregon, United States
	9	Rajiv Gupta , Mary Lou Soffa , Denise Ombres, Efficient register allocation via coloring using clique separators, ACM Transactions on Programming Languages and Systems (TOPLAS), v.16 n.3, p.370-386, May 1994 [doi>10.1145/177492.177499]
	10	Wei-Chung Hsu , Charles N. Fisher , James R. Goodman, On the Minimization of Loads/Stores in Local Register Allocation, IEEE Transactions on Software Engineering, v.15 n.10, p.1252-1260, October 1989 [doi>10.1109/TSE.1989.559775]
	11	James R. Larus , Paul N. Hilfinger, Register allocation in the SPUR Lisp compiler, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.255-263, June 25-27, 1986, Palo Alto, California, United States
	12	Todd A. Proebsting , Charles N. Fischer, Probabilistic register allocation, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.300-310, June 15-19, 1992, San Francisco, California, United States
	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, Program structure as a basis for the parallelization of global compiler optimizations, Carnegie Mellon University, Pittsburgh, PA, 1992
	16	Angelika Zobel. Program structure as basis for paraUelizing global register allocation. In International Conference on Computer Languages, 1992.