Abstract
The approach presented in this paper focus on detecting data dependences induced by heap-directed pointers on loops that access dynamic data structures. Knowledge about the shape of the data structure accessible from a heap-directed pointer, provides critical information for disambiguating heap accesses originating from it. Our approach is based on a previously developed shape analysis that maintains topological information of the connections among the different nodes (memory locations) in the data structure. Basically, the novelty is that our approach carries out abstract interpretation of the statements being analyzed, and let us annotate the memory locations reached by each statement with read/write information. This information will be later used in order to find dependences in a very accurate dependence test which we introduce in this paper.
This work was supported in part by the Ministry of Education of Spain under contract TIC2003-06623.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Corbera, F., Asenjo, R., Zapata, E.L.: A framework to capture dynamic data structures in pointer-based codes. Transactions on Parallel and Distributed System 15(2), 151–166 (2004)
Ghiya, R., Hendren, L.J.: Putting pointer analysis to work. In: Proc. 25th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, California, January 1998, pp. 121–133 (1998)
Ghiya, R., Hendren, L.J., Zhu, Y.: Detecting parallelism in c programs with recursive data strucutures. In: Proc. 1998 International Conference on Compiler Construction, March 1998, pp. 159–173 (1998)
Hendren, L.J., Nicolau, A.: Parallelizing programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems 1, 35–47 (1990)
Hortwitz, S., Pfeiffer, P., Repps, T.: Dependence analysis for pointer variables. In: Proc. ACM SIGPLAN1989 Conference on Programming Language Design and Implementation, July 1989, pp. 28–40 (1989)
Hummel, J., Hendren, L.J., Nicolau, A.: A general data dependence test for dynamic, pointer-based data structures. In: Proc. ACM SIGPLAN1994 Conference on Programming Language Design and Implementation, June 1994, pp. 218–229 (1994)
Hwang, Y.S., Saltz, J.: Identifying parallelism in programs with cyclic graphs. In: Proc. 2000 International Conference on Parallel Processing, Toronto, Canada, August 2000, pp. 201–208 (2000)
Hwang, Y.S., Saltz, J.: Identifying parallelism in programs with cyclic graphs. Journal of Parallel and Distributed Computing 63(3), 337–355 (2003)
Larus, J.R., Hilfinger, P.N.: Detecting conflicts between structure accesses. In: Proc. ACM SIGPLAN1988 Conference on Programming Language Design and Implementation, July 1988, pp. 21–34 (1988)
Shapiro, M., Horwitz, S.: Fast and accurate flow-insensitive points-to analysis. In: Proc. 24th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Paris, France, January 1997, pp. 1–14 (1997)
Parr, T.J., Quong, R.W.: ANTLR: A predicated-LL(k) parser generator. Journal of Software Practice and Experience 25(7), 789–810 (1995)
Wilson, R.P., Lam, M.S.: Efficient context-sensitive pointer analysis for C programs. In: Proc. ACM SIGPLAN1995 Conference on Programming Language Design and Implementation, La Jolla, California, June 1995, pp. 1–12 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Navarro, A., Corbera, F., Asenjo, R., Tineo, A., Plata, O., Zapata, E.L. (2005). A New Dependence Test Based on Shape Analysis for Pointer-Based Codes. In: Eigenmann, R., Li, Z., Midkiff, S.P. (eds) Languages and Compilers for High Performance Computing. LCPC 2004. Lecture Notes in Computer Science, vol 3602. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11532378_28
Download citation
DOI: https://doi.org/10.1007/11532378_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28009-5
Online ISBN: 978-3-540-31813-2
eBook Packages: Computer ScienceComputer Science (R0)