Scheduling arithmetic and load operations in parallel with no spilling

Authors:
D. Bernstein;J. M. Jaffe;M. Rodeh
Affiliations:
Dept. of Electrical Engineering, Technion-Israel Institute of Technology, Haifa 32000, ISRAEL;IBM T.J. Watson Research Center, Yorktown Heights, NY;IBM Israel Scientific Center, Technion City, Haifa 32000, ISRAEL
Venue:
POPL '87 Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Year:
1987

Citing 10
Cited 3

Optimal scheduling of arithmetic operations in parallel with memory access (preliminary version)

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Generation of Optimal Code for Arithmetic Expressions

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)
Code Generation for Expressions with Common Subexpressions

Journal of the ACM (JACM)
The CRAY-1 computer system

Communications of the ACM - Special issue on computer architecture
On arithmetic expressions and trees

Communications of the ACM
On compiling algorithms for arithmetic expressions

Communications of the ACM
Code-generation for machines with multiregister operations

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Computer Architecture and Parallel Processing

Computer Architecture and Parallel Processing

Optimal Chaining in Expression Trees

IEEE Transactions on Computers
On the Complexity of Scheduling Problems for Parallel/Pipelined Machines

IEEE Transactions on Computers
Allocating registers in multiple instruction-issuing processors

PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques

Quantified Score

Hi-index	0.01

Visualization

Abstract

We consider a machine model in which load operations can be performed in parallel with arithmetic operations by two separate functional units. For this model, the evaluation of a set of expression trees is discussed. A dynamic programming algorithm to produce an approximate solution is described and analyzed. For binary trees its worse case cost is at most 9.1% worse than the optimal cost.