论文信息 - Optimal chaining in expression trees

Optimal chaining in expression trees

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.

Ron Y. Pinter | David Bernstein | Haran Boral

[1] Jeffrey D. Ullman,et al. The Generation of Optimal Code for Arithmetic Expressions , 1970, JACM.

[2] Richard M. Russell,et al. The CRAY-1 computer system , 1978, CACM.

[3] Alfred V. Aho,et al. Optimal code generation for expression trees , 1975, STOC.

[4] Michael Rodeh,et al. Scheduling arithmetic and load operations in parallel with no spilling , 1987, POPL '87.

[5] Siamak Arya. An Optimal Instruction-Scheduling Model for a Class of Vector Processors , 1985, IEEE Transactions on Computers.

[6] Ron Y. Pinter,et al. Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version) , 1985, POPL '85.

[7] Alfred V. Aho,et al. Code Generation for Expressions with Common Subexpressions , 1977, J. ACM.

[8] John L. Bruno,et al. Code Generation for a One-Register Machine , 1976, J. ACM.

[9] Ron Y. Pinter,et al. Optimal Scheduling of Arithmetic Operations in Parallel with Memory Accesses. , 1985 .

[10] Kai Hwang,et al. Computer architecture and parallel processing , 1984, McGraw-Hill Series in computer organization and architecture.