The Community for Technology Leaders
Green Image
Issue No. 11 - November (1988 vol. 37)
ISSN: 0018-9340
pp: 1366-1374
ABSTRACT
Chaining is the ability to pipeline two or more vector instructions on Cray-1 like machines. The authors show how to optimally use this feature to compute (vector) expression trees in the context of automatic code generation. They present a linear time scheduling algorithm for finding an optimal order of evaluation for a machine with a bounded number of registers.
INDEX TERMS
optimal chaining; vector instructions pipelining; complexity analysis; explicit pipelining; dynamic programming algorithms; expression trees; Cray-1; automatic code generation; linear time scheduling algorithm; automatic programming; computational complexity; dynamic programming; parallel programming; pipeline processing; scheduling.
CITATION

H. Boral, D. Bernstein and R. Pinter, "Optimal Chaining in Expression Trees," in IEEE Transactions on Computers, vol. 37, no. , pp. 1366-1374, 1988.
doi:10.1109/12.8702
89 ms
(Ver 3.3 (11022016))