Minimum cost interprocedural register allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Minimum cost interprocedural register allocation

Full text

Pdf (1.23 MB)

Source

Annual Symposium on Principles of Programming Languages archive
Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents

St. Petersburg Beach, Florida, United States

Pages: 230 - 241

Year of Publication: 1996

ISBN:0-89791-769-3

Authors

Steven M. Kurlander	Dept of Computer Sciences, 1210 W Dayton St. Madison, WI
Charles N. Fischer	Dept of Computer Sciences, 1210 W Dayton St. Madison, WI

Sponsors

SIGPLAN: ACM Special Interest Group on Programming Languages
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 7, Downloads (12 Months): 20, Citation Count: 8

Additional Information:

references cited by 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/237721.237780 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.

	BCKT89	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
	BL92	Thomas Ball , James R. Larus, Optimally profiling and tracing programs, Proceedings of the 19th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, p.59-70, January 19-22, 1992, Albuquerque, New Mexico, United States [doi>10.1145/143165.143180]
	Cam85	Kathie Cameron. Antichain sequences. Order, 2(3):249-255, 1985.
	Cha82	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
	CHKW86	F. Chow, M. Himmelstein, E. Killian, and L. Weber. Engineering a RISC compiler system. In Proceedings COMPCON, pages 132- 137, March 1986.
	CK91	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
	Kur95	Steven M. Kurlander. {nterprocedural Regzster Allocatwn. PhD thesis, University of Wisconsin-Madison, 1995." In preparation.
	Orl93	James B. Orlin, A faster strongly polynomial minimum cost flow algorithm, Operations Research, v.41 n.2, p.338-350, March–April 1993 [doi>10.1287/opre.41.2.338]
	PF92	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
	SH89	Peter A. Steenkiste , John L. Hennessy, A simple interprocedural register allocation algorithm and its effectiveness for LISP, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.1-32, Jan. 1989 [doi>10.1145/59287.59289]
	SO90	Vatsa Santhanam , Daryl Odnert, Register allocation across procedure and module boundaries, Proceedings of the ACM SIGPLAN 1990 conference on Programming language design and implementation, p.28-39, June 1990, White Plains, New York, United States
	Sta93	Richard M. Stallman. Using and Porting GNU CC. Free Software Foundation, October 1993.
	Wal86	David W. Wall, Global register allocation at link time, Proceedings of the 1986 SIGPLAN symposium on Compiler construction, p.264-275, June 25-27, 1986, Palo Alto, California, United States
	Zak95	Armand Zakarian. Private communication. University of Wisconsin--Madison, February 1995.

CITED BY 8

	Robert Cohn , P. Geoffrey Lowney, Hot cold optimization of large Windows/NT applications, Proceedings of the 29th annual ACM/IEEE international symposium on Microarchitecture, p.80-89, December 02-04, 1996, Paris, France
	Andreas Moshovos , Gurindar S. Sohi, Reducing Memory Latency via Read-after-Read Memory Dependence Prediction, IEEE Transactions on Computers, v.51 n.3, p.313-326, March 2002
	Liu Yang , Sun Chan , G. R. Gao , Roy Ju , Guei-Yuan Lueh , Zhaoqing Zhang, Inter-procedural stacked register allocation for itanium® like architecture, Proceedings of the 17th annual international conference on Supercomputing, June 23-26, 2003, San Francisco, CA, USA
	Milo M. Martin , Amir Roth , Charles N. Fischer, Exploiting dead value information, Proceedings of the 30th annual ACM/IEEE international symposium on Microarchitecture, p.125-135, December 01-03, 1997, Research Triangle Park, North Carolina, United States
	Volker Barthelmann, Inter-task register-allocation for static operating systems, ACM SIGPLAN Notices, v.37 n.7, July 2002
	Kun Zhang , Tao Zhang , Santosh Pande, Binary translation to improve energy efficiency through post-pass register re-allocation, Proceedings of the 4th ACM international conference on Embedded software, September 27-29, 2004, Pisa, Italy
	Yoonseo Choi , Hwansoo Han, Optimal register reassignment for register stack overflow minimization, ACM Transactions on Architecture and Code Optimization (TACO), v.3 n.1, p.90-114, March 2006
	Philip Brisk , Ajay K. Verma , Paolo Ienne, Optimal polynomial-time interprocedural register allocation for high-level synthesis and ASIP design, Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design, November 05-08, 2007, San Jose, California