David Bernstein, Haran Boral, et al.
IEEE TC
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
Amnon Joseph, Ron Y. Pinter
Integration, the VLSI Journal
David Bernstein, Michael Rodeh, et al.
Journal of Algorithms
Antoni Lozano, Ron Y. Pinter, et al.
IEEE/ACM TCBB