Definitions of dependence distance
- 1 September 1992
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Letters on Programming Languages and Systems
- Vol. 1 (3) , 261-265
- https://doi.org/10.1145/151640.151645
Abstract
Data dependence distance is widely used to characterize data dependences in advance optimizing compilers. The standard definition of dependence distance assumes that loops are normalized (have constant lower bounds and a step of 1); there is not a commonly accepted definition for unnormalized loops. We have identified several potential definitions, all of which give the same answer for normalized loops. There are a number of subtleties involved in choosing between these definitions, and no one definition is suitable for all applications.Keywords
This publication has 2 references indexed in Scilit:
- Array-data flow analysis and its use in array privatizationPublished by Association for Computing Machinery (ACM) ,1993
- Dataflow analysis of array and scalar referencesInternational Journal of Parallel Programming, 1991