Constraint-Based Array Dependence Analysis

ACM Transactions on Programming Languages and Systems

Volumn 20, Issue 3, 1998, Pages 635-678

  Pugh, William ^a   Wonnacott, David ^b  

^a University of Maryland ^*  (United States)

^b HAVERFORD COLLEGE   (United States)

Author keywords

Algorithms; Array dataflow analysis; D.3.4 Programming Languages : Processors compilers; optimization; Dependence abstraction; Dependence analysis; Languages; Parallelization; Presburger arithmetic; Static analysis

Indexed keywords

ARRAY DEPENDENCE ANALYSIS; STATIC ANALYSIS;

ALGORITHMS; BINARY CODES; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DATA FLOW ANALYSIS; DATA STORAGE EQUIPMENT; ITERATIVE METHODS; PARALLEL PROCESSING SYSTEMS; SET THEORY; VECTORS; ARRAYS; COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; DIGITAL ARITHMETIC; PROGRAM COMPILERS;

COMPUTER PROGRAMMING LANGUAGES; DATA FLOW ANALYSIS;

ARRAY DEPENDENCE ANALYSIS; BENCHMARK PROGRAMS; PRESBURGER ARITHMETIC;

EID: 0032058019     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/291889.291900     Document Type: Article

References (63)

1. AHO, A. V., SETHI, R., AND ULLMAN, J. D. 1986. Compilers: Principles, Techniques and Tools. Addison-Wesley, Reading, Mass.
2. ALPERN, B., WEGMAN, M. N., AND ZADECK, F. K. 1988. Detecting equality of values in programs. Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, 1-11.
3. BANERJEE, U. 1993. Loop Transformations for Restructuring Compilers: The Foundations. Kluwer Academic Publishers.
4. BARTHOU, D., COLLARD, J.-F., AND FEAUTRIER, P. 1996. Fuzzy array dataflow analysis. Tech. Rep. 96-025, PRiSM Laboratory Université de Versailles.
5. BARTHOU, D., COLLARD, J.-F., AND FEAUTRIER, P. 1997. Fuzzy array dataflow analysis. Parallel Distributed Computing 40, 210-226.
6. BERRY, M. ET AL. 1989. The PERFECT Club benchmarks: Effective performance evaluation of supercomputers. International Journal Supercomputing Applications 3, 3 (Mar.), 5-40.
7. BLUME, W. J. 1995. Symbolic analysis techniques for effective automatic parallelization. Ph.D. thesis, Dept. of Computer Science, U. of Illinois at Urbana-Champaign.
8. BRANDES, T. 1988. The importance of direct dependences for automatic parallelism. In Proceedings of the 2nd International Conference on Supercomputing. 407-417.
9. CALLAHAN, D. AND KENNEDY, K. 1988. Analysis of interprocedural side effects in a parallel environment. Journal Parallel Distributed Computing, 5:517-550.
10. COLLARD, J.-F., BARTHOU, D., AND FEAUTRIER, P. 1995. Fuzzy array dataflow analysis. In Proceedmgs of the 5th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. 92-101.
11. COLLARD, J.-F. AND FEAUTRIER, P. 1994. Fuzzy array dataflow analysis. Tech. Rep. Research Report No 94-21, Laboratoire de l'Informatique du Parallélisme, Ecolo Normal Supérieure de Lyon, Instiut IMAG. July
12. COOPER, D. C. 1972. Theorem proving in arithmetic without multiplication. In Machine Intelligence 7, B. Meltzer and D. Michie, Eds. Edinburgh University Press, Edinburgh, 91-99.
13. CYTRON, R., FERRANTE, J., ROSEN, B., WEGMAN, M., AND ZADECK, F. K. 1991. Efficiently computing static single assignment form and the control dependence graph. ACM Trans. Programming Languages Systems 13, 4 (Oct.), 451-490.
14. DOWNEY, P. 1972. Undeciability of presburger arithmetic with a single monadic predicate letter. Tech. Rep. 18-72, Center for Research in Computing Technology, Havard Univ.
15. EIGENMANN, R., HOEFLINGER, J., LI, Z., AND PADUA, D. 1991. Experience in the automatic parallelization of 4 Perfect benchmark programs. In Proceedings of the 4th Workshop on Programming Languages and Compilers for Parallel Computing. Also Technical Report 1193, CSRD, Univ. of Illinois.
16. EIGENMANN, R., HOEFLINGER, J., AND PADUA, D. 1998. On the automatic parallelization of the Perfect benchmarks. IEEE Trans. Parallel Distributed Systems 9, 1 (Jan.). Also Technical Report 1392, CSRD, Univ. of Illinois.
17. FEAUTRIER, P. 1988. Parametric integer programming. Operationnelle/Operations Research 22, 3 (Sept.), 243-268.
18. FEAUTRIER, P. 1991. Dataflow analysis of scalar and array references. International Journal Parallel Programming 20, 1 (Feb.), 23-53.
19. GAREY, M. R. AND JOHNSON, D. S. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company.
20. GROSS, T. AND STEENKISTE, P. 1990. Structured dataflow analysis for arrays and its use in an optimizing compiler. Software - Practice Experience 20, 133-155.
21. HAGHIGHAT, M. AND POLYCHRONOPOULOS, C. 1991. Symbolic dependence analysis for high-performance parallelizing compilers. In Advances In Languages And Compilers for Parallel Processing.
22. HALL, M. W., KARVEY, T., KENNEDY, K., MCINTOSH, N., MCKINLEY, K., OLDHAM, J. D., PALECZNY, M., AND ROTH, G. 1993. Experiences using the Parascope editor: an interactive parallel programming tool. In Proceedings of the 4th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming.
23. HUYNH, T., LASSEZ, C., AND LASSEZ, J.-L. 1992. Practical issues on the projection of polyhedral sets. Annals mathematics artificial intelligence 6, 4 (Nov.), 295-316.
24. IMBERT, J.-L. 1993. Fourier's elimination: Which to choose? In Principles and Practice of Constraint Programming. Newport, Rode Island. Available as ftp://wilma.cs.brown .edu/pub/ppcp93/imbert.ps.Z.
25. KELLY, W., MASLOV, V., PUGH, W., ROSSER, E., SHPEISMAN, T., AND WONNACOTT, D. 1995. The Omega Library interface guide. Tech. Rep. CS-TR-3445, Dept. of Computer Science, University of Maryland, College Park. Mar. The Omega library is available from http://www.cs.umd.edu/projects/omega.
26. KELLY, W. A. 1996. Optimization within a unified transformation framework. Ph.D. thesis, Dept. of Computer Science, The University of Maryland.
27. KENNEDY, K., MCKINLY, K., AND TSENG, C.-W. 1990. Interactive parallel programming using the Parascope editor. Tech. Rep. RICE COMP TR90-096, Dept. of Computer Science, Rice University. Oct.
28. KREISEL, G. AND KREVINE, J. L. 1967. Elements of Mathematical Logic. North-Holland Pub. Co.
29. LI, Z. 1992. Array privatization for parallel execution of loops. In Proceedings of the 1992 International Conference on Supercomputing. 313-322.
30. MASLOV, V. 1992. Delinearization: an efficient way to break multiloop dependence equations. In ACM SIGPLAN '92 Conference on Programming Language Design and Implementation. San Francisco, California.
31. MASLOV, V. 1994, Lazy array data-flow dependence analysis. In ACM '94 Conference on Principles of Programming Languages.
32. MASLOV, V. AND PUGH, W. 1994. Simplifying polynomial constraints over integers to make dependence analysis more precise. In Conference on Algorithms and Hardware for Parallel Processing.
33. MAYDAN, D. E. 1992. Accurate analysis of array references. Ph.D. thesis, Computer Systems Laboratory, Stanford U.
34. MAYDAN, D. E., AMARASINGHE, S. P., AND LAM, M. S. 1992. Data dependence and data-flow hrefhttp://suif.stanford.edu/papers/maydan92b.psanalysis of arrays. In 5th Workshop on Languages and Compilers for Parallel Computing (Yale University tech. report YALEU/DCS/RR915). 283-292.
35. MAYDAN, D. E., AMARASINGHE, S. P., AND LAM, M. S. 1993. Array data-flow analysis and its use in array privatization. In ACM '93 Conference on Principles of Programming Languages.
36. MCKINLEY, K. S. 1990. Dependence analysis of arrays subscripted by index arrays. Tech. Rep. RICE COMP TR91-163, Dept. of Computer Science, Rice University. Dec.
37. 22pn upper bound on the complexity of presburger arithmetic. Journal Computer System Sciences 16, 3 (July), 323-332.
38. PADUA, D. A., EIGENMANN, R., HOEFLINGER, J., PETERSON, P., TU, P., WEATHERFORD, S., AND FAIGIN, K. 1993. Polaris: A new-generation parallelizing compiler for MPP's. CSRD Rpt. 1306, Dept. of Computer Science, University of Illinois at Urbana-Champaign. June.
39. PETERSEN, P. M. AND PADUA, D. A. 1992. Dynamic dependence analysis: A novel method for data dependence evaluation. In 5th Workshop on Languages and Compilers for Parallel Computing. Yale University. Also Technical Report 1228, CSRD, Univ. of Illinois.
40. PETERSEN, P. M. AND PADUA, D. A. 1993. Static and dynamic evaluation of data dependence analysis. In Proceedings of the 1993 International Conference on Supercomputing. Tokyo, Japan.
41. PETERSEN, P. M. AND PADUA, D. A. 1996. Static and dynamic evaluation of data dependence analysis. IEEE Transactions Parallel Distributed Systems 7, 11 (Nov.), 1121-1132.
42. PUGH, W. 1991. Uniform techniques for loop optimization. In Proceedings of the 1991 International Conference on Supercomputing. Cologne, Germany, 341-352.
43. PUGH, W. 1992. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Comm. ACM 8, 102-114.
44. PUGH, W. AND WONNACOTT, D. 1992. Eliminating false data dependences using the Omega test. In SIGPLAN Conference on Programming Language Design and Implementation. San Francisco, California, 140-151.
45. PUGH, W. AND WONNACOTT, D. 1993. An exact method for analysis of value-based array data dependences. In Proceedings of the 6th Annual Workshop on Programming Languages and Compilers for Parallel Computing. Lecture Notes in Computer Science, vol. 768. Springer-Verlag, Berlin.
46. PUGH, W. AND WONNACOTT, D. 1994a. Experiences with constraint-based array dependence analysis. In Principles and Practice of Constraint Programming, Second International Workshop. Lecture Notes in Computer Science, vol. 874. Springer-Verlag, Berlin, 312-325.
47. PUGH, W. AND WONNACOTT, D. 1994b. Nonlinear array dependence analysis. Tech. Rep. CS-TR-3372, Dept. of Computer Science, University of Maryland, College Park. Nov.
48. PUGH, W. AND WONNACOTT, D. 1995a. Going beyond integer programming with the Omega test to eliminate false data dependences. IEEE Trans. Parallel Distributed Systems, 204-211.
49. PUGH, W. AND WONNACOTT, D. 1995b. Nonlinear array dependence analysis. In Third Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers. Troy, New York.
50. RAUCHWERGER, L. AND PADUA, D. 1994. The privatizing doall test: A run-time technique for doall loop identification and array privatization. Tech. Rep. 1383, Univ. of Illinois at Urbana-Champaign, Center for Supercomputing Res. & Dev.
51. RAUCHWERGER, L. AND PADUA, D. 1995. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In ACM SIGPLAN '95 Conference on Programming Language Design and Implementation. La Jolla, California.
52. RIBAS, H. 1990. Obtaining dependence vectors for nested-loop computations. In Proceedings of 1990 International Conference on Parallel Processing. II-212 - II-219.
53. ROSEN, B. K., WEGMAN, M. N., AND ZADECK, F. K. 1988. Global value numbers and redundant computations. Conference Record of the Fifteenth ACM Symposium on Principles of Programming Languages, 12-27.
54. ROSENE, C. 1990. Incremental dependence analysis. Ph.D. thesis, Dept. of Computer Science, Rice University.
55. SHOSTAK, R. E. 1979. A practical decision procedure for arithmetic with function symbols. Journal ACM 26, 2 (Apr.), 351-360.
56. TU, P. 1995. Automatic array privatization and demand-driven symbolic analysis. Ph.D. thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign.
57. TU, P. AND PADUA, D. 1992. Array privatization for shared and distributed memory machines. In Workshop on Languages, Compilers, and Run-Time Environments for Distributed Memory Multiprocessors.
58. VOEVODIN, V. V. 1992a. Mathematical Foundations of Parallel Computing. World Scientific Series in Computer Science, vol. 33. World Scientific Publishers, Singapore.
59. VOEVODIN, V. V. 1992b. Theory and practice of parallelism detection in sequential programs. Programming and Computer Software (Programmirovaniye) 18, 3 (May).
60. WOLFE, M. J. 1989. Optimizing Supercompilers for Supercomputers. The MIT Press, Cambridge, Mass.
61. WONNACOTT, D. G. 1995. Constraint-based array dependence analysis. Ph.D. thesis, Dept. of Computer Science, The University of Maryland.
62. ZIMA, H. AND CHAPMAN, B. 1990. Supercompilers for Parallel and Vector Computers. Addison-Wesley, New York, N.Y.
63. ACM Transactions on Programming Languages and Systems, Vol. 20, No. 3, May 1998, Pages 679-706.