Abstract
In this book, we introduce many important dependence concepts and techniques in terms of a single loop containing assignment statements, then generalize first to a double loop, then to a perfect loop nest, and finally to a program consisting of arbitrarily nested loops. This way the reader is exposed to complicated ideas and notation in steps that makes understanding of the material easier. This chapter is devoted to a study of the dependence problem in a single loop.
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.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Single Loops. In: Dependence Analysis. Loop Transformation for Restructuring Compilers, vol 3. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28122-3_2
Download citation
DOI: https://doi.org/10.1007/978-0-585-28122-3_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9809-7
Online ISBN: 978-0-585-28122-3
eBook Packages: Springer Book Archive