Abstract
Data dependence testing is the basic step in detecting loop level parallelism in numerical programs. The problem is undecidable in the general case. Therefore, work has been concentrated on a simplified problem, affine memory disambiguation. In this simpler domain, array references and loops bounds are assumed to be linear integer functions of loop variables. Dataflow information is ignored. For this domain, we have shown that in practice the problem can be solved accurately and efficiently.(1) This paper studies empirically the effectiveness of this domain restriction, how many real references are affine and flow insensitive. We use Larus's llpp system(2) to find all the data dependences dynamically. We compare these to the results given by our affine memory disambiguation system. This system is exact for all the cases we see in practice. We show that while the affine approximation is reasonable, memory disambiguation is not a sufficient approximation for data dependence analysis. We propose extensions to improve the analysis.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
D. E. Maydan, J. L. Hennessy, and M. S. Lam, Efficient and exact data dependence analysis,Proc. of the SIGPLAN PLDI, pp. 1–14 (1991).
James R. Larus, Estimating the potential parallelism in programs,Proc. of the Third Workshop on Languages and Compilers for Parallel Computing, Chapter 17, MIT Press, pp. 331–349 (1991).
U. Banerjee,Dependence Analysis for Supercomputing, Kluwer Academic (1988).
M. Wolfe,Optimizing Supercompilers for Supercomputers, The MIT Press (1989).
Z. Li and P. Yew, Practical methods for exact data dependency analysis,Proc. of the Second Workshop on Languages and Compliers for Parallel Computing (1989).
Z. Li, P. Yew, and C. Zhu, An efficient data dependence analysis for parallelizing compilers,IEEE Trans. on Parallel and Distributed Systems 1(1):26–34 (January 1990).
D. R. Wallace, Dependence of multi-dimensional array references,Proc. of Int'l. Conf. on Parallel Processing, pp. 418–428 (1988).
M. Berry, D.-K. Chen, P. Koss, D. Kuck, L. Pointer, S. Lo, Y. Pang, R. Roloff, A. Sameh, E. Clementi, S. Chin, D. Schneider, G. Fox, P. Messina, D. Walker, C. Hsiung, J. Schwarzmeier, K. Lue, S. Orszag, F. Seidel, O. Johnson, G. Swanson, R. Goodram, J. Martin, The PERFECT Club benchmarks: effective performance evaluation of super-computers. Technical Report UIUCSRD Rep. No. 827, University of Illinois, Urbana-Champaign (1989).
P. Feautrier, Array expansion,Int'l. Conf. on Supercomputing, pp. 429–442 (1988).
M. R. Haghighat, Symbolic dependence analysis for high performance parallelizing compilers,3rd Workshop on Programming Languages and Compilers for Parallel Computing (1990).
A. Lichnewsky and F. Thomasset. Introducing symbolic problem solving techniques in dependence testing phases of a vectorizer,Proc. of Supercomputing, pp. 396–406 (1988).
Author information
Authors and Affiliations
Additional information
This research was supported in part by a fellowship from AT & T Bell Laboratories and by DARPA contract N00014-87-K-0828.
Rights and permissions
About this article
Cite this article
Maydan, D.E., Hennessy, J.L. & Lam, M.S. Effectiveness of data dependence analysis. Int J Parallel Prog 23, 63–81 (1995). https://doi.org/10.1007/BF02577784
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02577784