Optimal chaining in expression trees

Authors:
David Bernstein;Haran Boral;Ron Y. Pinter
Affiliations:
Israel Institute of Technology;MCC;IBM Israel Scientific Center
Venue:
SIGPLAN '86 Proceedings of the 1986 SIGPLAN symposium on Compiler construction
Year:
1986

Citing 7
Cited 0

Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version)

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees

Journal of the ACM (JACM)
Code Generation for a One-Register Machine

Journal of the ACM (JACM)
Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
The CRAY-1 computer system

Communications of the ACM - Special issue on computer architecture
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.