The definition of dependence distance

Authors:
Michael Wolfe
Affiliations:
Oregon Graduate Institute of Science and Technology
Venue:
ACM Transactions on Programming Languages and Systems (TOPLAS)
Year:
1994

Citing 4
Cited 5

Advanced compiler optimizations for supercomputers

Communications of the ACM - Special issue on parallelism
Supercompilers for parallel and vector computers

Supercompilers for parallel and vector computers
Definitions of dependence distance

ACM Letters on Programming Languages and Systems (LOPLAS)
The Organization of Computations for Uniform Recurrence Equations

Journal of the ACM (JACM)

Synthesis of an application-specific soft multiprocessor system

Proceedings of the 2007 ACM/SIGDA 15th international symposium on Field programmable gate arrays
Synthesis algorithm for application-specific homogeneous processor networks

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
How many threads to spawn during program multithreading?

LCPC'10 Proceedings of the 23rd international conference on Languages and compilers for parallel computing
Towards the optimal synchronization granularity for dynamic scheduling of pipelined computations on heterogeneous computing systems

Concurrency and Computation: Practice & Experience
C2FPGA-A dependency-timing graph design methodology

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several definitions of dependence distance can be found in the literature. A single coherent definition is the vector distance between the iteration vectors of two iterations involved in a dependence relation. Different ways to associate iteration vectors with iterations can give different dependence distances to the same program, and have different advantages.