Conference paper
Compiler optimization of C++ virtual function calls
Sara Porat, David Bernstein, et al.
COOTS 1996
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
Sara Porat, David Bernstein, et al.
COOTS 1996
David Bernstein, Haran Boral, et al.
ACM SIGPLAN Notices
David Bernstein, Doron Cohen, et al.
MICRO 1991
Luis F. Ortiz, Ron Y. Pinter, et al.
The Journal of Supercomputing