Abstract
To represent execution orders that cannot be defined by a sequential loop nest, we need to introduce more general program constructs.
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). Introduction to Loop Transformations. In: Loop Transformations for Restructuring Compilers: The Foundations. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-28004-2_6
Download citation
DOI: https://doi.org/10.1007/978-0-585-28004-2_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9318-4
Online ISBN: 978-0-585-28004-2
eBook Packages: Springer Book Archive