Method of Elimination

Part of the Loop Transformation for Restructuring Compilers book series (LTRC, volume 3)


In this chapter, we discuss the method of elimination as outlined in Algorithm 1.3. We have already used elimination at several places in the book. A simple dependence problem, by definition, is one where elimination is trivial. For a simple problem, the method of elimination lets us find integer solutions almost as easily as real solutions. The prime example of that was seen in Chapter 2 for dependence problems involving one-dimensional arrays in single loops. Our focus here is on problems where that is not the case. We have already seen dependence problems where elimination is nontrivial, for instance, in the example of Chapter 1 and in Example 3.4.


Real Solution Integer Solution Dependence Problem Dependence Equation Dependence Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1997

Personalised recommendations