OPTIMAL CHAINING IN EXPRESSION-TREES

被引：3

作者：

BERNSTEIN, D

BORAL, H

PINTER, RY

机构：

[1] MICROELECTR & COMP TECHNOL CORP,ADV COMP ARCHITECTURE PROGRAM,AUSTIN,TX 78759

[2] IBM ISRAEL SCI CTR,PROGRAMMING LANGUAGES GRP,IL-32000 HAIFA,ISRAEL

[3] TECHNION ISRAEL INST TECHNOL,DEPT ELECT ENGN,HAIFA,ISRAEL

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1988年 / 37卷 / 11期

关键词：

MATHEMATICAL PROGRAMMING; DYNAMIC - MATHEMATICAL TECHNIQUES -- Trees;

D O I：

10.1109/12.8702

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Chaining is the ability to pipeline two or more vector instructions on Cray-1-like machines. The authors show how to use this feature optimally 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.

引用

页码：1366 / 1374

页数：9

共 10 条

[1] OPTIMAL CODE GENERATION FOR EXPRESSION TREES [J].