Abstract
In Chapter 4, we introduced the basic dependence concepts in the context of a perfect nest L of m loops. In this chapter, we consider the mathematical problem of actually computing the dependence of a statement on a statement, caused by a pair of variables. To derive the complete dependence information for L, one needs to find the dependence caused by each pair of variables in the program.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Kluwer Academic Publishers
About this chapter
Cite this chapter
Banerjee, U. (1993). Linear Dependence Problem. In: Loop Transformations for Restructuring Compilers: The Foundations. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28004-2_5
Download citation
DOI: https://doi.org/10.1007/978-0-585-28004-2_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9318-4
Online ISBN: 978-0-585-28004-2
eBook Packages: Springer Book Archive