Interprocedural parallelization analysis in SUIF

ACM Transactions on Programming Languages and Systems

Volumn 27, Issue 4, 2005, Pages 662-731

  Hall, Mary W ^a   Amarasinghe, Saman P ^b,e   Murphy, Brian R ^c   Liao, Shih Wei ^c   Lam, Monicas ^d  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INTEL CORPORATION   (United States)

^d STANFORD UNIVERSITY   (United States)

^e MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Data dependence analysis; Interprocedural data flow analysis; Parallelization; Symbolic analysis

Indexed keywords

DATA DEPENDENCE ANALYSIS; INTERPROCEDURAL DATA-FLOW ANALYSIS; PARALLELIZATION; SYMBOLIC ANALYSIS;

COMPUTATION THEORY; DATA FLOW ANALYSIS; DATA STORAGE EQUIPMENT; MULTIPROCESSING PROGRAMS; PARALLEL PROCESSING SYSTEMS; PRIVATIZATION; SYNCHRONIZATION;

PROGRAM COMPILERS;

EID: 33645444470     PISSN: 01640925     EISSN: 01640925     Source Type: Journal    
DOI: 10.1145/1075382.1075385     Document Type: Article

References (83)

1. ADVE, V., CABLE, A., GRANSTON, E., HIRANANDANI, S., KENNEDY, K., KOELBEL, C., U. KREMER, J. M.-C., TSENG, C.-W., AND WARREN, S. 1994. Requirements for data-parallel programming environments. IEEE Trans. Paral. Distrib. Tech. 2, 3, 48-58.
2. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers Principles, Techniques, and Tools, Second ed. Addison-Wesley, Reading, Mass.
3. ALLEN, F. AND COCKE, J. 1976. A program data flow analysis procedure. Commun. ACM 19, 3 (Mar.), 137-147.
4. AMARASINGHE, S. 1997. Parallelizing compiler techniques based on linear inequalities. Ph.D. dissertation, Dept. of Electrical Engineering, Stanford Univ, Stanford, Calif.
5. AMARASINGHE, S., ANDERSON, J., WILSON, C., LIAO, S., MURPHY, B., FRENCH, R., LAM, M., AND HALL, M. 1996. Multiprocessors from a software perspective. IEEE Micro 16, 3 (June), 52-61.
6. AMMARGUELLAT, Z. AND HARRISON, W. 1990. Automatic recognition of induction variables and recurrence relations by abstract interpretation. In Proceedings of the SIGPLAN '90 Conference on Programming Language Design and Implementation (White Plains, N.Y). ACM, New York.
7. ANDERSON, J. M., AMARASINGHE, S. P., AND LAM, M. S. 1995. Data and computation transformations for multiprocessors. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Santa Barbara, Calif.). ACM, New York, 166-178.
8. BAILEY, D., BARTON, J., LASINSKI, T., AND SIMON, H. 1991. The NAS parallel benchmarks. Int. J. Supercomput. Appl. 5, 3 (Fall), 63-73.
9. BALASUNDARAM, V. AND KENNEDY, K. 1989. A technique for summarizing data access and its use in parallelism enhancing transformations. In Proceedings of the SIGPLAN '89 Conference on Programming Language Design and Implementation (Portland, Ore.). ACM, New York.
10. BALL, J.E. 1979. Predicting the effects of optimization on a procedure body. ACM SIGPLAN Notices 14, 8, 214-220.
11. BANERJEE, U. 1988. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Boston, Mass.
12. BANNING, J. P. 1979. An efficient way to find the side effects of procedure calls and the aliases of variables. In Proceedings of the 6th Annual Symposium on Principles of Programming Languages. ACM, New York.
13. BLELLOCH, G. E. 1990. Prefix sums and their applications. Technical Report CMU-CS-90-190, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pa. Nov.
14. (Also published in Synthesis of Parallel Algorithms, ed. J. E. Reif.)
15. BLUME, W. 1995. Symbolic analysis techniques for effective automatic parallelization. Ph.D. dissertation.
16. BLUME, W., DOALLO, R., EIGENMANN, R., GROUT, J., HOEFLINGER, J., LAWRENCE, T., LEE, J., PADUA, D., PAEK, Y., POTTENGER, B., RAUCHWERGER, L., AND TU, P. 1996. Parallel programming with Polaris. IEEE Comput. 29, 12 (Dec.), 78-82.
17. BLUME, W. AND EIGENMANN, R. 1992. Performance analysis of parallelizing compilers on the Perfect Benchmarks programs. IEEE Trans. Paral. Distrib. Syste. 3, 6 (Nov.), 643-656.
18. BLUME, W. AND EIGENMANN, R. 1994. The range test: A dependence test for symbolic, non-linear expressions. In Proceedings of Supercomputing '94. IEEE Computer Society Press, New York.
19. BUONION, E., ANDERSON, J. M., MOWRY, T. C., ROSENBLUM, M., AND LAM, M. S. 1996. Compiler-directed page coloring for multiprocessors. In Proceedings of the 7th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-VII) (Cambridge, Mass.).
20. BURKE, M. AND CYTRON, R. 1986. Interprocedural dependence analysis and parallelization. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction (Palo Alto, Calif.). ACM, New York.
21. CARHOLL, M. AND RYDER, B. 1987. An incremental algorithm for software analysis. In Proceedings of the SIGPLAN/SIGSOFT Software Engineering Symposium on Practical Software Development Environments. SIGPLAN Notices 22, 1, 171-179.
22. COOPER, K., HALL, M., AND KENNEDY, K. 1993. A methodology for procedure cloning. Comput. Lang. 19, 2 (Apr.).
23. COOPER, K., HALL, M. W., AND TORCZON, L. 1991. An experiment with inline substitution. Softw. - Pract. Exper. 21, 6 (June), 581-601.
24. COOPER, K. AND KENNEDY, K. 1984. Efficient computation of flow insensitive interprocedural summary information. In Proceedings of the SIGPLAN '84 Symposium on Compiler Construction. SIGPLAN Notices 19, 6, 247-258.
25. COOPER, K. D., HALL, M. W., KENNEDY, K., AND TORCZON, L. 1995. Interprocedural analysis and optimization. Commun. Pure Appl. Math. 48.
26. CREUSILLET, B. 1996. Array region analyses and applications. Ph.D. dissertaion. Ecole des Mines de Paris.
27. CREUSILLET, B. AND IRIGOIN, F. 1995. Interprocedural array region analyses. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing, Springer-Verlag, New York.
28. CYBENKO, G., KIPP, L., POINTER, L., AND KUCK, D. 1990. Supercomputer performance evaluation and the Perfect benchmarks. In Proceedings of the 1990 ACM International Conference on Supercomputing (Amsterdam, The Netherlands). ACM, New York.
29. DANTZIG, G. AND EAVES, B. 1973. Fourier-Motzkin elimination and its dual. J. Combinat. Theory (A) 14, 288-297.
30. FEAUTRIER, P. 1988a. Array expansion. In Proceedings of the 2nd International Conference on Supercomputing (St. Malo, France).
31. FEAUTRIER, P. 1988b. Parametric integer programming. Recherche Operationnelle / Oper. Res. 22, 3 (Sept.), 243-268.
32. FEAUTRIER, P. 1991. Dataflow analysis of scalar and array references. Int. J. Paral. Prog. 20, 1 (Feb.), 23-52.
33. GOFF, G., KENNEDY, K., AND TSENG, C.-W. 1991. Practical dependence testing. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation (Toronto, Ont., Canada). ACM, New York.
34. GRAHAM, S. L. AND WEGMAN, M. 1976. A fast and usually linear algorithm for global data flow analysis. J. ACM 23, 1, 172-202.
35. GRANSTON, E. D. AND VEIDENBAUM, A. 1991. Detecting redundant accesses to array data. In Proceedings of Supercomputing '91 (Albuquerque, N.M.) IEEE Computer Society Press, Los Alamitos, Calif.
36. GROSS, T. AND STEENKISTE, P. 1990. Structured dataflow analysis for arrays and its use in an optimizing compiler. Soft. - Pract. Exper. 20, 2 (Feb.), 133-155.
37. GROUT, J. 1995. Inline expansion for the Polaris research compiler. M.S. thesis, Center for Supercomputing Research and Development, University of Illinois at Urbana-Champaign.
38. HAGHIGHAT, M. AND POLYCHRONOPOLOUS, C. 1996. Symbolic analysis for parallelizing compilers. ACM Trans. Prog. Lang. Syst. 18, 4 (July).
39. HALL, M., ANDERSON, J., AMARASINGHE, S., MURPHY, B., LIAO, S., BUGNION, E., AND LAM, M. 1996. Maximizing multiprocessor performance with the SUIF compiler. IEEE Comput. 29, 12 (Dec.), 84-89.
40. HALL, M. AND KENNEDY, K. 1992. Efficient call graph analysis. ACM Lett. Prog. Lang. Syst. 1, 3 (Sept.), 227-242.
41. HALL, M. W., AMARASINGHE, S. P., MURPHY, B. R., LIAO, S.-W., AND LAM, M. S. 1995a. Detecting coarse-grain parallelism using an interprocedural parallelizing compiler. In Proceedings of Supercomputing '95 (San Diego, Calif.). IEEE Computer Society Press, Los Alamitos, Calif.
42. HALL, M. W., MELLOR-CRUMMEY, J., CARLE, A., AND RODRIGUEZ, R. 1993. FIAT: A framework for interprocedural analysis and transformation. In Proceedings of the Sixth Workshop on Languages and Compilers for Parallel Computing (Portland, Ore.).
43. HALL, M. W., MURPHY, B. R., AND AMARASINGHE, S. P. 1995b. Interprocedural analysis for parallelization: Design and experience. In Proceedings of the Seventh SIAM Conference on Parallel Processing for Scientific Computing (San Francisco, Calif.). SIAM, Philadelphia, Pa, 650-655.
44. HALL, M. W., MURPHY, B. R., AMARASINGHE, S. P., LIAO, S.-W., AND LAM, M. S. 1995c. Interprocedural analysis for parallelization. In Proceedings of the 8th International Workshop on Languages and Compilers for Parallel Computing. Springer-Verlag, New York.
45. HARRISON, W. 1989. The interprocedural analysis and automatic parallelization of Scheme programs. Lisp and Symbolic Computation 2, 3/4 (Oct.), 179-396.
46. HAVLAK, P. 1994. Interprocedural symbolic analysis. Ph.D. dissertation. Dept. of Computer Science, Rice University.
47. HAVLAK, P. AND KENNEDY, K. 1991. An implementation of interprocedural bounded regular section analysis. IEEE Tran. Paral. Distrib. Syst. 2, 3 (July), 350-360.
48. HIND, M., BURKE, M., CARINI, P., AND MIDKIFF, S. 1994. An empirical study of precise interprocedural array analysis. Sci. Prog. 3, 3, 255-271.
49. HUMMEL, S. F., SCHONBERG, E., AND FLYNN, L. E. 1992. Factoring: A method for scheduling parallel loops. Commun. ACM 35, 8 (Aug.), 90-101.
50. IRIGOIN, F. 1992. Interprocedural analyses for programming environments. In Proceedings of the NSF-CNRS Workshop on Evironments and Tools for Parallel Scientific Programming. North-Holland, Amsterdam, The Netherlands.
51. IRIGOIN, F., JOUVELOT, P., AND TRIOLET, R. 1991. Semantical interprocedural parallelization: An overview of the PIPS project. In Proceedings of the 1991 ACM International Conference on Supercomputing (Cologne, Germany). ACM, New York.
52. KAM, J. AND ULLMAN, J. 1976. Global data flow analysis and iterative algorithms. J. ACM 23, 1 (Jan.), 159-171.
53. KENNEDY, K. 1976. A comparison of two algorithms for global data flow analysis. SIAM J. Computing 5, 1, 158-180.
54. LANDI, W. AND RYDER, B. 1992. A safe approximate algorithm for interprocedural pointer aliasing. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation, SIGPLAN Notices 27(7), 235-248.
55. LI, Z. AND YEW, P. 1988. Efficient interprocedural analysis for program restructuring for parallel programs. In Proceedings of the ACM SIGPLAN Symposium on Parallel Programming: Experience with Applications, Languages, and Systems (PPEALS) (New Haven, Conn.). ACM, New York.
56. MARLOWE, T. J. AND RYDER, B. G. 1990. Properties of data flow frameworks: A unified model. Acta Inf. 28, 121-163.
57. MASLOV, V. 1992. Delinearization: An efficient way to break multiloop dependence equations. In Proceedings of the ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. ACM, New York.
58. MAYDAN, D. E., AMARASINGHE, S. P., AND LAM, M. S. 1993. Array data-flow analysis and its use in array privatization. In Proceedings of the 20th Annual ACM Symposium on the Principles of Programming Languages (Charleston, S.C.). ACM, New York, 2-15.
59. MAYDAN, D. E., HENNESSY, J. L., AND LAM, M. S. 1991. Efficient and exact data dependence analysis. In Proceedings of the SIGPLAN '91 Conference on Programming Language Design and Implementation (Toronto, Ont., Canada). ACM, New York.
60. MAYDAN, D. E., HENNESSY, J. L., AND LAM, M. S. 1992. Effectiveness of data dependence analysis. In Proceedings of the NSF-NCRD Workshop on Advanced Compilation Techniques for Novel Architectures.
61. MOWRY, T., LAM, M. S., AND GUPTA, A. 1992. Design and evaluation of a compiler algorithm for prefetching. In Proceedings of the 5th International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-V) (Boston, Mass.). 62-73.
62. MYERS, E. 1981. A precise inter-procedural data flow algorithm. In Conference Record of the 8th Annual Symposium on Principles of Programming Languages. ACM, New York.
63. PADUA, D. A. AND WOLFE, M. J. 1986. Advanced compiler optimizations for supercomputers. Commun. ACM 29, 12 (Dec.), 1184-1201.
64. POLYCHRONOPOULOS, C. 1986. On program restructuring, scheduling, and communication for parallel processor systems. Ph.D. dissertation. Dept. Computer Science. Univ. Illinois at Urbana-Champaign.
65. POTTENGER, B. AND EIGENMANN, R. 1995. Parallelization in the presence of generalized induction and reduction variables. In Proceedings of the 1995 ACM International Conference on Supercomputing. ACM, New York.
66. PUGH, W. AND WONNACOTT, D. 1992. Eliminating false data dependences using the Omega test. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation (San Francisco, Calif.). ACM, New York.
67. REILLY, J. 1995. SPEC describes SPEC95 products and benchmarks. Spec newsletter, SPEC. September.
68. RIBAS, H. 1990. Obtaining dependence vectors for nested-loop computations. In Proceedings of the 1990 International Conference on Parallel Processing (St. Charles, Ill.).
69. SCHRIJVER, A. 1986. Theory of Linear and Integer Programming. Wiley, Chichester, Great Britain.
70. SHARIR, M. AND PNUELI, A. 1981. Two approaches to interprocedural data flow analysis. In Program Flow Analysis: Theory and Applications, S. Muchnick and N. Jones, Eds. Prentice-Hall, Inc., Englewood Cliffs., N.J.
71. SHIVERS, O. 1991. Control-flow analysis of higher-order languages. Ph.D. dissertation, School of Computer Science, Carnegie Mellon Univ., Pittsburgh, Pa.
72. SINGH, J. P. AND HENNESSY, J. L. 1991. An empirical investigation of the effectiveness of and limitations of automatic parallelization. In Proceedings of the International Symposium on Shared Memory Multiprocessors (Tokyo, Japan).
73. TARJAN, R. 1981a. A unified approach to path problems. J. ACM 28, 3 (July), 577-593.
74. TARJAN, R. E. 1981b. Fast algorithms for solving path problems. J. ACM 28, 3 (July), 594-614.
75. TJIANG, S. AND HENNESSY, J. 1992. Sharlit - A tool for building optimizers. In Proceedings of the SIGPLAN '92 Conference on Programming Language Design and Implementation. SIGPLAN Notices 27, 1, 82-93.
76. TRIOLET, R., IRIGOIN, F., AND FEAUTRIER, P. 1986. Direct parallelization of CALL statements. In Proceedings of the SIGPLAN '86 Symposium on Compiler Construction (Palo Alto, Calif). ACM, New York.
77. TSENG, C.-W. 1995. Compiler optimizations for eliminating barrier synchronization. In Proceedings of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (Santa Barbara, Calif.). ACM, New York, 144-155.
78. TU, P. 1995. Automatic array privatization and demand-driven symbolic analysis. Ph.D. dissertation, Dept. Computer Science, Univ. Illinois at Urbana-Champaign.
79. TU, P. AND PADUA, D. 1993. Automatic array privatization. In Proceedings of the 6th Workshop on Languages and Compilers for Parallel Computing (Portland, Ore.).
80. ULLMAN, J. 1973. Fast algorithms for the elimination of common subexpressions. Acta Inf. 2, 191-213.
81. UNIEJEWSKI, J. 1989. SPEC Benchmark Suite: Designed for today's advanced systems. SPEC Newsletter Volume 1, Issue 1, SPEC. Fall.
82. WOLF, M. E. 1992. Improving locality and parallelism in nested loops. Ph.D. dissertation. Dept. of Computer Science, Stanford Univ., Stanford, Calif.
83. WOLFE, M. J. AND BANERJEE, U. 1987. Data dependence and its application to parallel processing. Int. J. Parall. Prog. 16, 2 (Apr.), 137-178.