Method of Bounds

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


Algorithm 1.2 is an approximate dependence algorithm that checks if (1) the system of dependence equations has an integer solution, and (2) the combined system of equations and inequalities has a real solution. The method of bounds is an implementation of Algorithm 1.2 that consists of two major tests: the generalized gcd test to check for an integer solution to the equations, and the bounds test to check for a real solution to the equations and the inequalities. We covered the first test in Section 5.4; this chapter is devoted to the second. For this chapter, we need several mathematical definitions and results that have been collected in the appendix.


Direction Vector Real Solution Integer Solution Integer Variable Loop Nest 
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