ACM Home Page
Please provide us with feedback. Feedback
Machine-independent register allocation
Full text PdfPdf (309 KB)
Source Symposium on Compiler Construction archive
Proceedings of the 1979 SIGPLAN symposium on Compiler construction table of contents
Denver, Colorado, United States
Pages: 221 - 225  
Year of Publication: 1979
ISBN:0-89791-002-8
Also published in ...
Author
Richard L. Sites  Dept. of Electrical Engineering and Computer Sciences, University of California at San Diego, La Jolla, CA
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800229.806973
What is a DOI?

ABSTRACT

The context of this paper is a machine-independent Pascal optimizer that transforms an intermediate stack-machine pseudo-code program into a generally smaller and faster pseudo-code program. The emphasis of this current paper is on the approach taken for mapping registers and storage, using an abstract but practical definition of the target machine's storage hierarchy. A companion paper [7] describes the overall optimizer project. After starting on this project, additional input became available from a Fortran-to-Pcode compiler written at Stanford [2]. Our storage mapping design is sufficiently robust that the addition of Fortran EQUIVALENCE and COMMON statements required no changes. Our particular allocation algorithm is not unique or original, but the abstract description of the storage hierarchy, and its inclusion of practical considerations we feel to be an original contribution. The description framework has so far stood the test of describing the storage hierarchy of many commercially-available machines without needing to be extended or embellished. We hope that this is a good predictor for the future.


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
Chow, F. 1979. "UCFORT," Stanford Artificial Intelligence Laboratory, Stanford, CA.
 
2
Day, W.H.E. 1970. "Compiler assignment of data items to registers," IBM Systems Journal 9:4, pp. 281-317.
3
 
4
Harrison, W. 1975. "A class of register allocation algorithms," IBM Research Report RC-5342.
 
5
 
6
Leverett, B.W. et al. 1979. "An overview of the production quality compiler-compiler project," Computer science report CS-79-105, Carnegie-Mellon University.
7
 
8



Peer to Peer - Readers of this Article have also read: