On Materializations of Array-Valued Temporaries

Authors:
Daniel J. Rosenkrantz;Lenore R. Mullin;Harry B. Hunt, III
Affiliations:
-;-;-
Venue:
LCPC '00 Proceedings of the 13th International Workshop on Languages and Compilers for Parallel Computing-Revised Papers
Year:
2000

Citing 11
Cited 1

Using C++ template metaprograms

C++ gems
Optimizing Fortran90D/HPF for distributed-memory computers

Optimizing Fortran90D/HPF for distributed-memory computers
An APL Compiler for a Vector Processor

ACM Transactions on Programming Languages and Systems (TOPLAS)
Compiling stencils in high performance Fortran

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Compilation and delayed evaluation in APL

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
ZPL: An Array Sublanguage

Proceedings of the 6th International Workshop on Languages and Compilers for Parallel Computing
Optimizing Fortran 90 Shift Operations on Distributed-Memory Multicomputers

LCPC '95 Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing
Optimization of Data-Parallel Field Expressions in the POOMA Framework

ISCOPE '97 Proceedings of the Scientific Computing in Object-Oriented Parallel Environments
The Matrix Template Library: A Generic Programming Approach to High Performance Numerical Linear Algebra

ISCOPE '98 Proceedings of the Second International Symposium on Computing in Object-Oriented Parallel Environments
An apl machine

An apl machine
Efficient evaluation of array subscripts of arrays

IBM Journal of Research and Development

A uniform way of reasoning about array-based computation in radar: Algebraically connecting the hardware/software boundary

Digital Signal Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present results demonstrating the usefulness of monolithic program analysis and optimization prior to scalarization. In particular, models are developed for studying nonmaterialization in basic blocks consisting ofa sequence of assignment statements involving array-valued variables. We use these models to analyze the problem ofmi nimizing the number ofmat erializations in a basic block, and to develop an efficient algorithm for minimizing the number of materializations in certain cases.