Definitions of dependence distance

Authors:
William Pugh
Affiliations:
Univ. of Maryland, College Park
Venue:
ACM Letters on Programming Languages and Systems (LOPLAS)
Year:
1992

Citing 4
Cited 4

Supercompilers for parallel and vector computers

Supercompilers for parallel and vector computers
Experiences with data dependence abstractions

ICS '91 Proceedings of the 5th international conference on Supercomputing
Uniform techniques for loop optimization

ICS '91 Proceedings of the 5th international conference on Supercomputing
Array-data flow analysis and its use in array privatization

POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

The definition of dependence distance

ACM Transactions on Programming Languages and Systems (TOPLAS)
Static analysis of upper and lower bounds on dependences and parallelism

ACM Transactions on Programming Languages and Systems (TOPLAS)
Outer loop pipelining for application specific datapaths in FPGAs

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
An approximate method for filtering out data dependencies with a sufficiently large distance between memory references

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.