Abstract
In Chapter 2, we gave a detailed introduction to the concepts and techniques of dependence analysis using a single loop as the model. In Chapter 3, we showed how things can become complicated very quickly when there are two loops to deal with. The model for this chapter is a perfect nest of an arbitrary number of loops. Our goal is to properly formulate the linear dependence problem in the context of such a program. We will not discuss methods of solution in this chapter except in some special cases (Section 4.6) and examples. Matrix notation becomes almost a necessity at this point; without that, we run the risk of drowning in a sea of subscripts. The reader should keep on hand a double loop of the form
where p10, q10, p20, p21, q20, and q21 are integer constants, and try to understand the results and notation of this chapter first in terms of that particular perfect nest. Note that in Chapter 3, we wrote p1 for p10, and q1 for q10.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Perfect Loop Nests. In: Dependence Analysis. Loop Transformation for Restructuring Compilers, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28122-3_4
Download citation
DOI: https://doi.org/10.1007/978-0-585-28122-3_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9809-7
Online ISBN: 978-0-585-28122-3
eBook Packages: Springer Book Archive