** Next:** Case Study: Direct Matrix
** Up:** Optimization Strategies for HPJava
** Previous:** Loop Unrolling
** Contents**

#

Applying PRE, SR, DCE, and LU

The main issue of the current HPJava optimization is to eliminate the
complexity of the associated terms in the subscript expression of a
multiarray element access, generally located in inner `overall`
loops, and to lift out HPJava compiler generated expensive method calls
to outer loops. Thus, in this section, we will apply PRE, Strength
Reduction, DCE, and LU optimization strategies to some naively
translated HPJava programs such as *direct matrix multiplication*
from Figure 3.13 and Laplace equation using
red-black relaxation from Figure 3.11.

**Subsections**

Bryan Carpenter
2004-06-09