Index Register Allocation

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Index Register Allocation

Full text

Pdf (1.21 MB)

Source

Journal of the ACM (JACM) archive
Volume 13 , Issue 1 (January 1966) table of contents

Pages: 43 - 61

Year of Publication: 1966

ISSN:0004-5411

Authors

L. P. Horwitz	Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, New York
R. M. Karp	Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, New York
R. E. Miller	Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, New York
S. Winograd	Thomas J. Watson Research Center, IBM Corporation, Yorktown Heights, New York

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 36, Citation Count: 22

Additional Information:

abstract references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	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/321312.321317 What is a DOI?

ABSTRACT

A procedure for index register allocation is described. The rules of this procedure are shown to yield an optimal allocation for “straight line” programs.

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	BACKS, J, W., ET AI,. The FORTRAN automatic coding system. Proe. Western Joint Comput. Conf., pp. 188-198, Feb,, 1957. (Now available from Spartan Books, Washington D. C.)
	2	DANTZIG, G. B, On the shortest route through a network. Manage. Si. (1960), 187-190.
	3	Mool, E. F. The shortest path through a maze. Proc. Int. Syrup. Theory of Switching, Ann. Comput. Lab., Harvard U., Vol. 30, 1959, pp. 285-292.

CITED BY 22

	F. Luccio, A comment on index register allocation, Communications of the ACM, v.10 n.9, p.572-574, Sept. 1967
	Ravi Sethi, Validating register allocations for straight line programs, Proceedings of the fourth annual ACM symposium on Theory of computing, p.222-237, May 01-03, 1972, Denver, Colorado, United States
	David J. Kolson , Alexandru Nicolau , Nikil Dutt , Ken Kennedy, Optimal register assignment to loops for embedded code generation, Proceedings of the 8th international symposium on System synthesis, p.42-47, September 13-15, 1995, Cannes, France
	Waleed M. Meleis , Edward S. Davidson, Optimal local register allocation for a multiple-issue machine, Proceedings of the 8th international conference on Supercomputing, p.107-116, July 11-15, 1994, Manchester, England
	W. M. Waite, The mobile programming system: STAGE2, Communications of the ACM, v.13 n.7, p.415-421, July 1970
	Ravi Sethi, Complete register allocation problems, Proceedings of the fifth annual ACM symposium on Theory of computing, p.182-195, April 30-May 02, 1973, Austin, Texas, United States
	Waleed M. Meleis , Edward S. Davidson, Dual-issue scheduling with spills for binary trees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.678-686, January 17-19, 1999, Baltimore, Maryland, United States
	R. A. Freiburghouse, Register allocation via usage counts, Communications of the ACM, v.17 n.11, p.638-642, Nov. 1974
	James D. Shuler , Henry R. Bauer, III, Look-ahead allocation in the presence of branches, Proceedings of the 1997 ACM symposium on Applied computing, p.504-508, April 1997, San Jose, California, United States
	David J. Kolson , Alexandru Nicolau , Nikil Dutt , Ken Kennedy, Optimal register assignment to loops for embedded code generation, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.1 n.2, p.251-279, April 1996
	Olivier Temam, Investigating optimal local memory performance, ACM SIGPLAN Notices, v.33 n.11, p.218-227, Nov. 1998
	A. V. Aho , S. C. Johnson , J. D. Ullman, Code generation for expressions with common subexpressions (Extended Abstract), Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languages, p.19-31, January 19-21, 1976, Atlanta, Georgia
	A. V. Aho , S. C. Johnson , J. D. Ullman, Code Generation for Expressions with Common Subexpressions, Journal of the ACM (JACM), v.24 n.1, p.146-160, Jan. 1977
	Martin Farach , Vincenzo Liberatore, On local register allocation, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, p.564-573, January 25-27, 1998, San Francisco, California, United States
	Doug Burger , James R. Goodman , Alain Kägi, Memory bandwidth limitations of future microprocessors, ACM SIGARCH Computer Architecture News, v.24 n.2, p.78-89, May 1996
	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
	Paul B. Schneck, A survey of compiler optimization techniques, Proceedings of the annual conference, p.106-113, August 27-29, 1973, Atlanta, Georgia, United States
	Gary A. Kildall, A unified approach to global program optimization, Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.194-206, October 01-03, 1973, Boston, Massachusetts
	Guido Araujo , Guilherme Ottoni , Marcelo Cintra, Global array reference allocation, ACM Transactions on Design Automation of Electronic Systems (TODAES), v.7 n.2, p.336-357, April 2002
	J. R. Goodman , W. C. Hsu, On the use of registers vs. cache to minimize memory traffic, ACM SIGARCH Computer Architecture News, v.14 n.2, p.375-383, June 1986
	Jerome Feldman , David Gries, Translator writing systems, Communications of the ACM, v.11 n.2, p.77-113, Feb. 1968
	William F. Atchison , Samuel D. Conte , John W. Hamblen , Thomas E. Hull , Thomas A. Keenan , William B. Kehl , Edward J. McCluskey , Silvio O. Navarro , Werner C. Rheinboldt , Earl J. Schweppe , William Viavant , David M. Young, Jr., Curriculum 68: Recommendations for academic programs in computer science: a report of the ACM curriculum committee on computer science, Communications of the ACM, v.11 n.3, p.151-197, March 1968