New Shape Analysis and Interprocedural Techniques for Automatic Parallelization of C Codes

International Journal of Parallel Programming

Volumn 30, Issue 1, 2002, Pages 37-63

  Corbera, Francisco ^a   Asenjo, Rafael ^a   Zapata, Emilio ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Parallelizing compiler; Pointers; Recursive data structures; Shape analysis; Shape graphs

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DYNAMICS; NUMERICAL METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SEMANTICS;

ACYCLIC DIRECT GRAPH; PARALLELIZING COMPILER; POINTERS; RECURSIVE DATA; SHAPE ANALYSIS; SHAPE GRAPH;

CODES (SYMBOLS);

EID: 0348126364     PISSN: 08857458     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1013224504467     Document Type: Article

References (13)

1. U. Banerjee, Loop Transformations for Restructuring Compilers: The Foundations, Kluwer (1993).
2. M. Sagiv, T. Reps, and R. Wilhelm, Solving shape-analysis problems in laguages with destructive updating, ACM Trans. Progr. Lang. Syst., 20(1):1-50 (January 1998).
3. J. Hummel, L. J. Hendren, and A. Nicolau, A general data dependence test for dynamic, pointer-based data structures, in Proc. SIGPLAN Conf. Progr. Lang. Design and Implementation, ACM Press, pp. 218-229 (1994).
4. L. Hendren and A. Nicolau, Parallelizing programs with recursive data structures, IEEE Trans. Parallel Distributed Syst., 1(4):35-47 (January 1990).
5. A. Matsumoto, D. S. Han, and T. Tsuda, Alias analysis of pointers in Pascal and Fortran 90: Dependence analysis between pointer references, Berlin/Heidelberg/New York: Springer-Verlag, Acta Informatica 33:99-130 (1996).
6. N. Jones and S. Muchnick, Flow analysis and optimization of lisp-like structures, in Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones (eds.), Englewood Cliffs, New Jersey, Prentice Hall, Chap. 4, pp. 102-131 (1981).
7. S. Horwitz, P. Pfeiffer, and T. Reps, dependence analysis for pointer variables, in Proc. SIGPLAN Conf. Progr. Lang. Design and Implementation, pp. 28-40 (June 1989).
8. D. Chase, M. Wegman, and F. Zadeck, Analysis of pointers and structures, in SIGPLAN Conf. Progr. Lang. Design and Implementation, ACM Press, New York, pp. 296-310 (1990).
9. J. R. Larus and P. N. Hilfinger. Detecting conflicts between structure accesses, in SIGPLAN Conf. Progr. Lang. Design and Implementation, ACM Press, New York, pp. 21-33 (1988).
10. J. Plevyak, A. Chien, and V. Karamcheti, Analysis of dynamic structures for efficient parallel execution, in Languages and Compilers for Parallel Computing, U. Banerjee, D. Gelernter, A. Nicolau, and D. Padua (eds.), Lectures Notes in Computer Science, Vol. 768, pp. 37-57, Berlin/Heidelberg/New York: Springer-Verlag (1993).
11. R. Asenjo, Sparse LU Factorization in Multiprocessors. Ph.D. Dissertation, Department Computer Architecture, University of Malaga, Spain (1997).
12. I. S. Duff, A. M. Erisman, and J. K. Reid, Direct Methods for Sparse Matrices, Oxford University Press, New York (1986).
13. F. Corbera, R. Asenjo, and E. L. Zapata, New shape analysis for automatic parallelization of C codes, in ACM Int'l. Conf. Supercomputing, Rhodes, Greece, pp. 220-227 (June 1999).