Luis F. Ortiz, Ron Y. Pinter, et al.
The Journal of Supercomputing
Paper
Optimal Chaining in Expression Trees
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. © 1986, ACM. All rights reserved.
Related
Conference paper
Optimal chaining in expression trees (Preliminary Version)
David Bernstein, Haran Boral, et al.
SIGPLAN Symposium on Compiler Construction 1986
David Bernstein, Shmuel Gal, et al.
Communications in Statistics. Part C: Stochastic Models
Reuven Bar-Yehuda, Jack A. Feldman, et al.
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems