Conference paper
Optimal chaining in expression trees (Preliminary Version)
David Bernstein, Haran Boral, et al.
SIGPLAN Symposium on Compiler Construction 1986
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. © 1988 IEEE
David Bernstein, Haran Boral, et al.
SIGPLAN Symposium on Compiler Construction 1986
David Bernstein, Haran Boral, et al.
ACM SIGPLAN Notices
Sara Porat, David Bernstein, et al.
COOTS 1996
David Bernstein, Michael Rodeh, et al.
IEEE TC