ACM Home Page
Please provide us with feedback. Feedback
Optimal chaining in expression trees
Full text PdfPdf (1,000 KB)
Source Symposium on Compiler Construction archive
Proceedings of the 1986 SIGPLAN symposium on Compiler construction table of contents
Palo Alto, California, United States
Pages: 1 - 10  
Year of Publication: 1986
ISBN:0-89791-197-0
Also published in ...
Authors
David Bernstein  Israel Institute of Technology
Haran Boral  MCC
Ron Y. Pinter  IBM Israel Scientific Center
Sponsor
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 21,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

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

ABSTRACT

Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. We show how to optimally use this feature to compute (vector) expression trees, in the context of automatic code-generation. We present a linear-time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of registers.


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.

 
A
Arya, S., "An optimal instructionscheduling model for a class of vector processors", IEEE Transactions on Cornputers, Vol. C-34, No. 11, (November 1985), 981-995.
AJ
AJU
BJPR
 
BJR
Bernstein, D., Jaffe, J.M., and Rodeh, M., "Scheduling arithmetic and load operations in parallel with no spilling", in preparation.
BS
 
C
Cray-I Hardware Reference Manual, Cray Research inc., Cray-I Comput. Syst. Publ. 2240004 (May 1979).
 
HB
R
SU

Collaborative Colleagues:
David Bernstein: colleagues
Haran Boral: colleagues
Ron Y. Pinter: colleagues