On compiling algorithms for arithmetic expressions

Authors:
Ikuo Nakata
Affiliations:
Central Research Laboratory, Hitachi, Ltd., Tokyo, Japan
Venue:
Communications of the ACM
Year:
1967

Citing 1
Cited 25

A note on some compiling algorithms

Communications of the ACM

Scheduling arithmetic and load operations in parallel with no spilling

POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On local register allocation

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Dual-issue scheduling with spills for binary trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
The Generation of Optimal Code for Arithmetic Expressions

Journal of the ACM (JACM)
The Generation of Optimal Code for Stack Machines

Journal of the ACM (JACM)
Optimal Code Generation for Expression Trees

Journal of the ACM (JACM)
Code Generation for a One-Register Machine

Journal of the ACM (JACM)
Efficient Computation of Expressions with Common Subexpressions

Journal of the ACM (JACM)
Instruction Sets for Evaluating Arithmetic Expressions

Journal of the ACM (JACM)
Subexpression ordering in the execution of arithmetic expressions

Communications of the ACM
On arithmetic expressions and trees

Communications of the ACM
Optimization of expressions in Fortran

Communications of the ACM
Efficient computation of expressions with common subexpressions

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A unified approach to global program optimization

POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Code-generation for machines with multiregister operations

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automatic microcode generation for horizontally microprogrammed processors

MICRO 14 Proceedings of the 14th annual workshop on Microprogramming
A comparison of instruction sets for stack machines

STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Optimal code generation for expression trees

STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Complete register allocation problems

STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A survey of compiler optimization techniques

ACM '73 Proceedings of the ACM annual conference
A formal approach to code optimization

Proceedings of a symposium on Compiler optimization
The switching reverse polise algorithm

ACM SIGPLAN Notices
Scope conserving expression evaluation: a class of storage optimal evaluation strategies for arithmetic expressions

ACM SIGPLAN Notices
Optimal evaluation order for expressions with redundant subexpressions

ACM SIGPLAN Notices - Abstracts in programming language-related research
Memory-optimal evaluation of expression trees involving large objects

Computer Languages, Systems and Structures

Quantified Score

Hi-index	48.27

Visualization

Abstract

This paper deals with algorithms concerning arithmetic expressions used in a FORTRAN IV compiler for a HITAC-5020 computer having n accumulators. The algorithms generate an object code which minimizes the frequency of storing and recovering the partial results of the arithmetic expressions in cases where there are several accumulators.