| Optimal chaining in expression trees |
| Full text |
Pdf
(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
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 3, Downloads (12 Months): 21, Citation Count: 0
|
|
|
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
|
David Bernstein , Ron Y. Pinter , Michael Rodeh, Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version), Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.325-333, January 14-16, 1985, New Orleans, Louisiana, United States
[doi> 10.1145/318593.318662]
|
| |
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
|
|
|